On nondeterministic unranked tree automata with sibling constraints
From MaRDI portal
Publication:2920139
DOI10.4230/LIPICS.FSTTCS.2009.2328zbMATH Open1248.68310MaRDI QIDQ2920139FDOQ2920139
Authors: Christof Löding, Karianto Wong 
Publication date: 24 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_5e2e.html
Recommendations
- Unranked Tree Automata with Sibling Equalities and Disequalities
- Bottom-Up Tree Automata with Term Constraints
- Automata on infinite trees with equality and disequality constraints between siblings
- Fundamentals of Computation Theory
- Decidable classes of tree automata mixing local and global constraints modulo flat theories
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Cited In (13)
- Projection for Büchi Tree Automata with Constraints between Siblings
- Emptiness and finiteness for tree automata with global reflexive disequality constraints
- Verifying quantitative temporal properties of procedural programs
- Projection for Büchi tree automata with constraints between siblings
- Tree automata with height constraints between brothers
- A Characterisation of Pi^0_2 Regular Tree Languages
- Automata on infinite trees with equality and disequality constraints between siblings
- Transformations between different models of unranked bottom-up tree automata
- Tree Automata with Global Constraints
- Unranked Tree Automata with Sibling Equalities and Disequalities
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
- Fundamentals of Computation Theory
- Solving a unification problem under constrained substitutions using tree automata
This page was built for publication: On nondeterministic unranked tree automata with sibling constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920139)
