Pages that link to "Item:Q1183576"
From MaRDI portal
The following pages link to QRT FIFO automata, breadth-first grammars and their relations (Q1183576):
Displaying 21 items.
- Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
- Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- Infinite Lyndon words (Q1322121) (← links)
- Quantum automata and quantum grammars (Q1566730) (← links)
- The calculi of emergence: Computation, dynamics and induction (Q1817022) (← links)
- On the decidability of the termination problem of active database systems (Q1884939) (← links)
- Queues, stacks, and transcendentality at the transition to chaos (Q1961669) (← links)
- The descriptional power of queue automata of constant length (Q2041686) (← links)
- Deque automata, languages, and planar graph representations (Q2192371) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- Set Automata (Q2814837) (← links)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
- Stack-like and queue-like dynamics in recurrent neural networks (Q3375554) (← links)
- Fair expressions and regular languages over lists (Q4348238) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- Self-Verifying Pushdown and Queue Automata (Q5164866) (← links)
- Diving into the queue (Q5223609) (← links)
- Boosting Reversible Pushdown and Queue Machines by Preprocessing (Q5859661) (← links)
- On computational complexity of set automata (Q5918383) (← links)
