Lower bounds for the size of deterministic unranked tree automata
From MaRDI portal
Publication:714828
DOI10.1016/J.TCS.2012.03.043zbMATH Open1257.68099OpenAlexW2081745941MaRDI QIDQ714828FDOQ714828
Authors: Xiaoxue Piao, Kai Salomaa 
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.043
Recommendations
Cites Work
- Title not available (Why is that?)
- Fundamentals of Computation Theory
- Automata for XML -- a survey
- On the minimization of XML schemas and tree automata for unranked trees
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- A Second Course in Formal Languages and Automata Theory
- Descriptional and computational complexity of finite automata -- a survey
- Descriptional complexity of machines with limited resources
- A lower bound technique for the size of nondeterministic finite automata
- Title not available (Why is that?)
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- Transformations between different models of unranked bottom-up tree automata
- Estimation of state complexity of combined operations
- Undecidability of the state complexity of composed regular operations
- Intersection and union of regular languages and state complexity
- Typechecking for XML transformers
- State complexity of Kleene-star operations on trees
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- Unambiguous finite automata over a unary alphabet
- State trade-offs in unranked tree automata
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
Cited In (6)
This page was built for publication: Lower bounds for the size of deterministic unranked tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714828)
