State Complexity of Operations on Input-Driven Pushdown Automata
From MaRDI portal
Publication:3088065
DOI10.1007/978-3-642-22993-0_44zbMath1343.68147OpenAlexW2128098489MaRDI QIDQ3088065
Alexander Okhotin, Kai Salomaa
Publication date: 17 August 2011
Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_44
Related Items (6)
Descriptional Complexity of Input-Driven Pushdown Automata ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ State complexity of the concatenation of regular tree languages ⋮ When input-driven pushdown automata meet reversiblity ⋮ Descriptional complexity of unambiguous input-driven pushdown automata ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties
This page was built for publication: State Complexity of Operations on Input-Driven Pushdown Automata
