Gaining Power by Input Operations: Finite Automata and Beyond

DOI10.1007/978-3-642-22256-6_3zbMath1297.68136OpenAlexW2234262632MaRDI QIDQ5200048

Martin Kutrib, Markus Holzer

Publication date: 29 July 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of languages defined by ciliate bio-operations
• Linear indexed languages
• On input-revolving deterministic and nondeterministic finite automata
• A geometric hierarchy of languages
• One way finite visit automata
• Closure and decidability properties of some language classes with respect to ciliate bio-operations.
• HYBRID EXTENDED FINITE AUTOMATA
• Deterministic Input-Reversal and Input-Revolving Finite Automata
• Iterated linear control and iterated one-turn pushdowns
• A Generalization of Ogden's Lemma
• Control sets on linear grammars
• Hairpin Finite Automata
• LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS
• Developments in Language Theory
• One-way stack automata
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata
• Classes of languages and linear-bounded automata
• Developments in Language Theory
• Operations and language generating devices suggested by the genome evolution