Introduction to formal languages
Introduction to formal languages
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Aspects of classical language theory
Handbook of formal languages, vol. 1
Journal of the ACM (JACM)
Automata and languages: theory and applications
Automata and languages: theory and applications
Acta Cybernetica
Introduction to Languages and the Theory of Computation
Introduction to Languages and the Theory of Computation
Elements of the Theory of Computation
Elements of the Theory of Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Algebraic Theory of Automata & Languages
Algebraic Theory of Automata & Languages
One-Turn Regulated Pushdown Automata and Their Reduction
Fundamenta Informaticae
On pure multi-pushdown automata that perform complete pushdown pops
Acta Cybernetica
Hi-index | 0.00 |
This paper introduces and discusses self-regulating finite automata. In essence, these automata regulate the use of their rules by a sequence of rules applied during previous moves. A special attention is paid to turns defined as moves during which a self-regulating finite automaton starts a new self-regulating sequence of moves. Based on the number of turns, the present paper establishes two infinite hierarchies of language families resulting from two variants of these automata. In addition, it demonstrates that these hierarchies coincide with the hierarchies resulting from parallel right linear grammars and right linear simple matrix grammars, so the self-regulating finite automata can be viewed as the automaton counterparts to these grammars. Finally, this paper compares both infinite hierarchies. In addition, as an open problem area, it suggests the discussion of self-regulating pushdown automata and points out that they give rise to no infinite hierarchy analogical to the achieved hierarchies resulting from the self-regulating finite automata.