Fundamentals of Computation Theory
From MaRDI portal
Publication:5492917
DOI10.1007/11537311zbMath1123.68055MaRDI 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
68Q45: Formal languages and automata
Related Items
State Trade-Offs in Unranked Tree Automata, An Automata Theoretic Approach to Rational Tree Relations, Lower bounds for the size of deterministic unranked tree automata, Automata for XML -- a survey, On the minimization of XML schemas and tree automata for unranked trees, State Complexity of Kleene-Star Operations on Trees