Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height

DOI10.1007/978-3-642-38536-0_9zbMath1362.68139OpenAlexW3023016654MaRDI QIDQ4928476

Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_9

zbMATH Keywords

regular languagesdescriptional complexityfinite state automatanondeterministic pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Boolean language operations on nondeterministic automata with a pushdown of constant height ⋮ Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* ⋮ 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 ⋮ Descriptional complexity of iterated uniform finite-state transducers

This page was built for publication: Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height