scientific article; zbMATH DE number 7315101

MaRDI QIDQ4964022zbMATH OpenFDO

Authors Xiaoxue Piao, Kai Salomaa

Publication date 24 February 2021

Full work available at URL https://arxiv.org/abs/1008.1658, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2010.18

zbMATH Keywords

nondeterminismtree automatastate complexityunranked trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Transformations between different models of unranked bottom-up tree automata
• Uniformization problems for tree-automatic relations and top-down tree transducers
• scientific article; zbMATH DE number 5654542
• Term Rewriting and Applications
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Fundamentals of Computation Theory
• On ground tree transformations and congruences induced by tree automata.
• Bottom-up tree pushdown automata and rewrite systems
• Automata for unordered trees
• Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees

Cited in

(5)

• Transformations between different models of unranked bottom-up tree automata
• State complexity of projection and quotient on unranked trees
• scientific article; zbMATH DE number 1953124 (Why is no real title available?)
• State trade-offs in unranked tree automata
• Lower bounds for the size of deterministic unranked tree automata

This page was built for publication:

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