Deterministic input-driven queue automata: finite turns, decidability, and closure properties
From MaRDI portal
Publication:2344746
Recommendations
- Input-driven queue automata: finite turns, decidability, and closure properties
- Input-Driven Queue Automata with Internal Transductions
- On the determinization of event-clock input-driven pushdown automata
- Further closure properties of input-driven pushdown automata
- Further closure properties of input-driven pushdown automata
- Queue Automata: Foundations and Developments
- On input-revolving deterministic and nondeterministic finite automata
- Deterministic Input-Reversal and Input-Revolving Finite Automata
- Self-verifying pushdown and queue automata
- The descriptional power of queue automata of constant length
Cites work
- A direct construction of finite state automata for pushdown store languages
- Adding nesting structure to words
- An Infinite Hierarchy of Context-Free Languages
- Complete formal systems for equivalence problems
- Descriptional complexity -- an introductory survey
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- Finite-Turn Pushdown Automata
- scientific article; zbMATH DE number 3885334 (Why is no real title available?)
- scientific article; zbMATH DE number 3961009 (Why is no real title available?)
- scientific article; zbMATH DE number 3696500 (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 3251418 (Why is no real title available?)
- scientific article; zbMATH DE number 3302285 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Input-driven stack automata
- Minimizing Variants of Visibly Pushdown Automata
- More concise representation of regular languages by automata and regular expressions
- Multiple equality sets and Post machines
- Nondeterministic state complexity of nested word automata
- On the intersection of stacks and queues
- One-way stack automata
- Operational state complexity of nested word automata
- Operator precedence and the visibly pushdown property
- QRT FIFO automata, breadth-first grammars and their relations
- Queue automata of constant length
- Reset machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- State complexity of operations on input-driven pushdown automata
- The equivalence problem for deterministic finite-turn pushdown automata
- The tree width of auxiliary storage
- Über einen Automaten mit Pufferspeicherung
- Visibly pushdown languages
Cited in
(16)- The descriptional power of queue automata of constant length
- Boolean language operations on nondeterministic automata with a pushdown of constant height
- Input-Driven Queue Automata with Internal Transductions
- Set automata
- When input-driven pushdown automata meet reversiblity
- Input-driven double-head pushdown automata
- Digging input-driven pushdown automata
- Queue Automata: Foundations and Developments
- Diving into the queue
- Input-driven queue automata: finite turns, decidability, and closure properties
- Input-driven multi-counter automata
- Descriptional complexity of iterated uniform finite-state transducers
- Input-driven multi-counter automata
- Input-Driven Double-Head Pushdown Automata
- Sweeping input-driven pushdown automata
- Sweeping input-driven pushdown automata
This page was built for publication: Deterministic input-driven queue automata: finite turns, decidability, and closure properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344746)
