Transformations between different models of unranked bottom-up tree automata

DOI10.3233/FI-2011-519MaRDI QIDQ3100917zbMATH OpenFDO

Authors Xiaoxue Piao, Kai Salomaa

Publication date 22 November 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2011-519

zbMATH Keywords

nondeterminismstate complexitytree automataunranked trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 7315101
• Lower bounds for the size of deterministic unranked tree automata
• On nondeterministic unranked tree automata with sibling constraints
• State trade-offs in unranked tree automata
• Fundamentals of Computation Theory

Cited in

(7)

• State complexity of Kleene-star operations on trees
• Tree shuffle
• State complexity of the concatenation of regular tree languages
• scientific article; zbMATH DE number 7315101 (Why is no real title available?)
• State trade-offs in unranked tree automata
• Limitations of lower bound methods for deterministic nested word automata
• Lower bounds for the size of deterministic unranked tree automata

This page was built for publication: Transformations between different models of unranked bottom-up tree automata

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