On nondeterministic unranked tree automata with sibling constraints

DOI10.4230/LIPICS.FSTTCS.2009.2328MaRDI QIDQ2920139zbMATH OpenFDO

Authors Christof Löding, Karianto Wong

Publication date 24 October 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_5e2e.html

zbMATH Keywords

monadic second-order logicunranked tree automataequality and disequality constraints

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

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

Cited in

(13)

• Unranked Tree Automata with Sibling Equalities and Disequalities
• Tree automata with height constraints between brothers
• Transformations between different models of unranked bottom-up tree automata
• The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
• A Characterisation of Pi^0_2 Regular Tree Languages
• Verifying quantitative temporal properties of procedural programs
• Fundamentals of Computation Theory
• Emptiness and finiteness for tree automata with global reflexive disequality constraints
• Projection for Büchi tree automata with constraints between siblings
• Tree Automata with Global Constraints
• Solving a unification problem under constrained substitutions using tree automata
• Automata on infinite trees with equality and disequality constraints between siblings
• Projection for Büchi Tree Automata with Constraints between Siblings

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)