Fundamentals of Computation Theory
From MaRDI portal
Publication:5492917
DOI10.1007/11537311zbMath1123.68055OpenAlexW2491671784MaRDI QIDQ5492917
Wolfgang Thomas, Christof Löding, Julien Cristau
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Related Items (9)
Which XML schemas are streaming bounded repairable? ⋮ State Complexity of Kleene-Star Operations on Trees ⋮ Deciding top-down determinism of regular tree languages ⋮ Automata for XML -- a survey ⋮ On the minimization of XML schemas and tree automata for unranked trees ⋮ Checking in polynomial time whether or not a regular tree language is deterministic top-down ⋮ Lower bounds for the size of deterministic unranked tree automata ⋮ An Automata Theoretic Approach to Rational Tree Relations ⋮ State Trade-Offs in Unranked Tree Automata
This page was built for publication: Fundamentals of Computation Theory
