Descriptional complexity of unambiguous nested word automata

DOI10.1007/978-3-642-21254-3_33MaRDI QIDQ3004601zbMATH OpenOpenAlexFDO

Authors Alexander Okhotin, Kai Salomaa

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Descriptional complexity of unambiguous input-driven pushdown automata
• Nondeterministic state complexity of nested word automata
• State Complexity of Nested Word Automata
• Descriptional complexity of input-driven pushdown automata
• Operational state complexity of nested word automata

Cited in

(7)

• Nondeterministic state complexity of nested word automata
• On the descriptional complexity of Watson-Crick automata
• Descriptional complexity of input-driven pushdown automata
• State Complexity of Nested Word Automata
• Descriptional complexity of unambiguous input-driven pushdown automata
• State trade-offs in unranked tree automata
• Limitations of lower bound methods for deterministic nested word automata

This page was built for publication: Descriptional complexity of unambiguous nested word automata

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