Deterministic Input-Reversal and Input-Revolving Finite Automata

DOI10.1007/978-3-540-88282-4_12MaRDI QIDQ3540102zbMATH OpenOpenAlexFDO

Authors Suna Bensch, Markus Holzer, Martin Kutrib, 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)

Recommendations

• On input-revolving deterministic and nondeterministic finite automata
• Developments in Language Theory
• Gaining Power by Input Operations: Finite Automata and Beyond
• Reversible nondeterministic finite automata
• Hybrid Extended Finite Automata

Cites work

• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 2038733 (Why is no real title available?)
• scientific article; zbMATH DE number 2040920 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Alternation
• Developments in Language Theory
• Developments in Language Theory
• Hybrid Extended Finite Automata
• One-way stack automata

Cited in

(8)

• Developments in Language Theory
• When input-driven pushdown automata meet reversiblity
• State complexity of reversals of deterministic finite automata with output
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• Hybrid Extended Finite Automata
• HYBRID EXTENDED FINITE AUTOMATA
• On input-revolving deterministic and nondeterministic finite automata
• Gaining Power by Input Operations: Finite Automata and Beyond

This page was built for publication: Deterministic Input-Reversal and Input-Revolving Finite Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540102)