Diving into the queue
From MaRDI portal
Publication:5223609
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3690693 (Why is no real title available?)
- scientific article; zbMATH DE number 5790353 (Why is no real title available?)
- scientific article; zbMATH DE number 3302285 (Why is no real title available?)
- A shrinking lemma for indexed languages
- Church-Rosser Thue systems and formal languages
- Complexity of multi-head finite automata: origins and directions
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Growing context-sensitive languages and Church-Rosser languages
- Indexed Grammars—An Extension of Context-Free Grammars
- Input-Driven Queue Automata with Internal Transductions
- Intercalation theorems for stack languages
- Nested Stack Automata
- On non-determinacy in simple computing devices
- On the descriptional power of heads, counters, and pebbles
- On the intersection of stacks and queues
- One-way stack automata
- QRT FIFO automata, breadth-first grammars and their relations
- Queue Automata: Foundations and Developments
- Reversible pushdown automata
- Reversible queue automata
- Stack automata and compiling
- Über einen Automaten mit Pufferspeicherung
This page was built for publication: Diving into the queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223609)