Transformations Between Different Models of Unranked Bottom-Up Tree Automata
From MaRDI portal
Publication:3100917
DOI10.3233/FI-2011-519zbMath1234.68235MaRDI QIDQ3100917
Publication date: 22 November 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Related Items
State Complexity of Kleene-Star Operations on Trees ⋮ Tree shuffle ⋮ State complexity of the concatenation of regular tree languages ⋮ Limitations of lower bound methods for deterministic nested word automata ⋮ Lower bounds for the size of deterministic unranked tree automata ⋮ State Trade-Offs in Unranked Tree Automata