On input-revolving deterministic and nondeterministic finite automata

DOI10.1016/j.ic.2009.03.002zbMath1192.68405OpenAlexW2010039268MaRDI QIDQ1041031

Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib

Publication date: 27 November 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.03.002

zbMATH Keywords

closure propertiescomputational poweranti abstract family of languagesextended finite automataformal language operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Two-way deterministic automata with jumping mode ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ A survey on automata with translucent letters ⋮ Sweep complexity revisited ⋮ Properties of right one-way jumping finite automata ⋮ JUMPING FINITE AUTOMATA ⋮ One-Way Jumping Finite Automata ⋮ Model matching of switched asynchronous sequential machines via matrix approach ⋮ Gaining Power by Input Operations: Finite Automata and Beyond

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A geometric hierarchy of languages
• Deterministic Input-Reversal and Input-Revolving Finite Automata
• Alternation
• Control sets on linear grammars
• Developments in Language Theory
• Control sets on grammars
• One-way stack automata
• Developments in Language Theory
• Hybrid Extended Finite Automata