Queue Automata of Constant Length
From MaRDI portal
Publication:2843090
DOI10.1007/978-3-642-39310-5_13zbMath1388.68173OpenAlexW51498564MaRDI QIDQ2843090
Katja Meckel, Carlo Mereghetti, Beatrice Palano, Sebastian Jakobi
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
straight-line programspushdown automatadescriptional complexitydeterministic automatanondeterministic automataqueue automata
Related Items
Boolean language operations on nondeterministic automata with a pushdown of constant height ⋮ Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* ⋮ Queue Automata: Foundations and Developments ⋮ Unnamed Item ⋮ Two double-exponential gaps for automata with a limited pushdown ⋮ Removing nondeterminism in constant height pushdown automata ⋮ The descriptional power of queue automata of constant length ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties