On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
From MaRDI portal
Publication:2914714
DOI10.1007/978-3-642-31606-7_22zbMath1297.68149OpenAlexW40619283MaRDI QIDQ2914714
Publication date: 20 September 2012
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_22
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Goedel speed-up and succinctness of language representations
- On stateless deterministic restarting automata
- Succinct description of regular languages by weak restarting automata
- Complexity of certain decision problems about congruential languages
- Restarting Automata with Auxiliary Symbols and Small Lookahead
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
- WHEN CHURCH-ROSSER BECOMES CONTEXT FREE
- OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA
- Regularity and Related Problems for Deterministic Pushdown Automata
- Recursive Unsolvability of a problem of Thue
- ON THE POWER OF RRWW-AUTOMATA
- Restarting automata
- A regularity test for pushdown machines
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS