ALESHIN TYPE AUTOMATA WITH REGULAR LANGUAGES
Abstract
In this paper, the investigation of reversibility in computational devices is complemented by the study of reversible Aleshin type automata. These are deterministic Aleshin type automata that are also backward deterministic. All regular languages as well as some non-regular languages are accepted by reversible deterministic Aleshin type automata. Thus, the computational capacity of reversible Aleshin type automata lies properly in between the regular and deterministic context-free languages. The closure properties and decidability questions of the language class are investigated. It turns out that the closure properties of reversible Aleshin type automata are similar to those of deterministic Aleshin type automata
Downloads
Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.