Queue Automata: Foundations and Developments
From MaRDI portal
Publication:5112182
DOI10.1007/978-3-319-73216-9_19zbMath1434.68274OpenAlexW2788537414MaRDI QIDQ5112182
Matthias Wendlandt, Andreas Malcher, Martin Kutrib
Publication date: 28 May 2020
Published in: Reversibility and Universality (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-73216-9_19
Related Items (7)
Unnamed Item ⋮ Deque automata, languages, and planar graph representations ⋮ Freezing 1-Tag Systems with States ⋮ Most pseudo-copy languages are not context-free ⋮ Self-Verifying Pushdown and Queue Automata ⋮ Diving into the queue ⋮ Boosting Reversible Pushdown and Queue Machines by Preprocessing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of multi-head finite automata: origins and directions
- A shrinking lemma for indexed languages
- Reversible computing and cellular automata -- a survey
- Fast reversible language recognition using cellular automata
- Tape versus queue and stacks: The lower bounds
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time
- On the intersection of stacks and queues
- Reset machines
- Multiple equality sets and Post machines
- QRT FIFO automata, breadth-first grammars and their relations
- Growing context-sensitive languages and Church-Rosser languages
- Reversible space equals deterministic space
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Reversible pushdown automata
- On the descriptional power of heads, counters, and pebbles
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- One-way reversible multi-head finite automata
- Über einen Automaten mit Pufferspeicherung
- Input-Driven Queue Automata with Internal Transductions
- Queue Automata of Constant Length
- Aspects of Reversibility for Classical Automata
- Two-Way Reversible Multi-Head Finite Automata
- On certain formal properties of grammars
- Adding nesting structure to words
- Visibly pushdown languages
- Irreversibility and Heat Generation in the Computing Process
- Church-Rosser Thue systems and formal languages
- Inference of Reversible Languages
- The Power of the Queue
- One-way multihead writing finite automata
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Reversible Queue Automata
- The equivalence problem for deterministic finite-turn pushdown automata
- Diving into the queue
- Intercalation theorems for stack languages
- Efficient Simulations by Queue Machines
- Finite-Turn Pushdown Automata
- Stack automata and compiling
- One-way stack automata
- Indexed Grammars—An Extension of Context-Free Grammars
- An Infinite Hierarchy of Context-Free Languages
- Nested Stack Automata
- Logical Reversibility of Computation
- Formal Reductions of the General Combinatorial Decision Problem
This page was built for publication: Queue Automata: Foundations and Developments
