Deterministic Input-Reversal and Input-Revolving Finite Automata

DOI10.1007/978-3-540-88282-4_12zbMath1156.68442OpenAlexW1525163431MaRDI QIDQ3540102

Martin Kutrib, Markus Holzer, Suna Bensch, Henning Bordihn

Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Gaining Power by Input Operations: Finite Automata and Beyond ⋮ On input-revolving deterministic and nondeterministic finite automata

Cites Work

• Alternation
• Developments in Language Theory
• One-way stack automata
• Developments in Language Theory
• Hybrid Extended Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item