Simulations of unary one-way multi-head finite automata
From MaRDI portal
Publication:5173291
DOI10.1142/S0129054114400139zbMATH Open1320.68112MaRDI QIDQ5173291FDOQ5173291
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Publication date: 9 February 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Finite automata and unary languages
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
- Magic numbers in the state hierarchy of finite automata
- Optimal simulations between unary automata
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- Converting two-way nondeterministic unary automata into simpler automata.
- Complementing unary nondeterministic automata
- State complexity of operations on two-way finite automata over a unary alphabet
- Bounded-reversal multihead finite automata languages
- Space-bounded reducibility among combinatorial problems
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
Cited In (8)
- Investigations on Automata and Languages Over a Unary Alphabet
- Title not available (Why is that?)
- Descriptional complexity of limited automata
- On Simulation Cost of Unary Limited Automata
- One-Way Multi-Head Finite Automata with Pebbles But No States
- Optimal simulations between unary automata
- On the descriptional power of heads, counters, and pebbles
- Descriptional complexity of regular languages
Recommendations
This page was built for publication: Simulations of unary one-way multi-head finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173291)
