On input-revolving deterministic and nondeterministic finite automata
From MaRDI portal
Publication:1041031
DOI10.1016/j.ic.2009.03.002zbMath1192.68405MaRDI 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
closure properties; computational power; anti abstract family of languages; extended finite automata; formal language operations
68Q45: Formal languages and automata
Related Items
JUMPING FINITE AUTOMATA, Model matching of switched asynchronous sequential machines via matrix approach, Gaining Power by Input Operations: Finite Automata and Beyond, Properties of right one-way jumping finite automata, One-Way Jumping Finite Automata, Two-way deterministic automata with jumping mode
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