Descriptional Complexity of Unambiguous Nested Word Automata
From MaRDI portal
Publication:3004601
DOI10.1007/978-3-642-21254-3_33zbMath1330.68172OpenAlexW2227258021MaRDI QIDQ3004601
Kai Salomaa, Alexander Okhotin
Publication date: 3 June 2011
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_33
Related Items
Descriptional Complexity of Input-Driven Pushdown Automata ⋮ State Trade-Offs in Unranked Tree Automata