Queue automata of constant length

DOI10.1007/978-3-642-39310-5_13MaRDI QIDQ2843090zbMATH OpenOpenAlexFDO

Authors Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano

Publication date 9 August 2013

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39310-5_13

zbMATH Keywords

descriptional complexitydeterministic automatanondeterministic automatapushdown automataqueue automatastraight-line programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The descriptional power of queue automata of constant length
• Queue Automata: Foundations and Developments
• More concise representation of regular languages by automata and regular expressions
• More Concise Representation of Regular Languages by Automata and Regular Expressions
• scientific article; zbMATH DE number 23833

Cited in

(12)

• The descriptional power of queue automata of constant length
• Removing nondeterminism in constant height pushdown automata
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• Boolean language operations on nondeterministic automata with a pushdown of constant height
• scientific article; zbMATH DE number 23833 (Why is no real title available?)
• Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
• Queue Automata: Foundations and Developments
• Two double-exponential gaps for automata with a limited pushdown
• scientific article; zbMATH DE number 7770052 (Why is no real title available?)
• Two-way finite automata with translucent input letters
• Latvian quantum finite state automata for unary languages
• Deterministic pushdown automata with translucent input letters

This page was built for publication: Queue automata of constant length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843090)