On the intersection of stacks and queues

DOI10.1016/0304-3975(88)90019-9zbMath0677.68088OpenAlexW2059530928MaRDI QIDQ1123639

Franz-Josef Brandenburg

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90019-9

zbMATH Keywords

queueresetstackpushdowncounter

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Fast nondeterministic recognition of context-free languages using two queues ⋮ Queue Automata: Foundations and Developments ⋮ Fair expressions and regular languages over lists ⋮ QRT FIFO automata, breadth-first grammars and their relations ⋮ Diving into the queue ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Familles de langages fermées par crochet ouvert
• On the intersection of the class of linear context-free languages and the class of single-reset languages
• Reset machines
• Automates a file
• Multiple equality sets and Post machines
• Three theorems concerning principal AFLs
• Single-tape reset machines
• Three write heads are as good ask