Deterministic Input-Reversal and Input-Revolving Finite Automata

DOI10.1007/978-3-540-88282-4_12zbMATH Open1156.68442OpenAlexW1525163431MaRDI QIDQ3540102FDOQ3540102

Martin Kutrib, Markus Holzer, Henning Bordihn, Suna Bensch

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)

Cites Work

• Alternation
• One-way stack automata
• Developments in Language Theory
• Developments in Language Theory
• Hybrid Extended Finite Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• 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
• 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)