Queue Automata: Foundations and Developments
From MaRDI portal
Queue Automata: Foundations and Developments
Recommendations
- scientific article; zbMATH DE number 23833
- Queue automata of constant length
- Input-driven queue automata: finite turns, decidability, and closure properties
- Self-verifying pushdown and queue automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Reachability problems on reliable and lossy queue automata
- Input-Driven Queue Automata with Internal Transductions
- Reachability problems on partially lossy queue automata
- Reversible queue automata
Cites work
- scientific article; zbMATH DE number 3961009 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3696500 (Why is no real title available?)
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 2038733 (Why is no real title available?)
- scientific article; zbMATH DE number 2040920 (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
- Adding nesting structure to words
- An Infinite Hierarchy of Context-Free Languages
- Aspects of reversibility for classical automata
- Church-Rosser Thue systems and formal languages
- Complexity of multi-head finite automata: origins and directions
- Descriptional complexity -- an introductory survey
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Diving into the queue
- Efficient Simulations by Queue Machines
- Fast reversible language recognition using cellular automata
- Finite-Turn Pushdown Automata
- Formal Reductions of the General Combinatorial Decision Problem
- Growing context-sensitive languages and Church-Rosser languages
- Indexed Grammars—An Extension of Context-Free Grammars
- Inference of Reversible Languages
- Input-Driven Queue Automata with Internal Transductions
- Intercalation theorems for stack languages
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- Multiple equality sets and Post machines
- Nested Stack Automata
- On certain formal properties of grammars
- On the descriptional power of heads, counters, and pebbles
- On the intersection of stacks and queues
- One-way multihead writing finite automata
- One-way reversible multi-head finite automata
- One-way stack automata
- QRT FIFO automata, breadth-first grammars and their relations
- Queue automata of constant length
- Reset machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Reversible computing and cellular automata -- a survey
- Reversible pushdown automata
- Reversible queue automata
- Reversible space equals deterministic space
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time
- Stack automata and compiling
- Tape versus queue and stacks: The lower bounds
- The Power of the Queue
- The equivalence problem for deterministic finite-turn pushdown automata
- Two-way reversible multi-head finite automata
- Visibly pushdown languages
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Über einen Automaten mit Pufferspeicherung
Cited in
(13)- Reachability problems on reliable and lossy queue automata
- Self-verifying pushdown and queue automata
- scientific article; zbMATH DE number 7584599 (Why is no real title available?)
- Queue automata of constant length
- Diving into the queue
- Input-Driven Queue Automata with Internal Transductions
- Boosting reversible pushdown and queue machines by preprocessing
- Decision problems on copying and shuffling
- The descriptional power of queue automata of constant length
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Freezing 1-Tag Systems with States
- Deque automata, languages, and planar graph representations
- Most pseudo-copy languages are not context-free
This page was built for publication: Queue Automata: Foundations and Developments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112182)
