Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
From MaRDI portal
Publication:4927423
DOI10.2168/LMCS-9(2:1)2013zbMath1278.68130arXiv1302.6960MaRDI QIDQ4927423
Luis Barguñó, Camille Vacher, Carles Creus, Florent Jacquemard, Guillem Godoy
Publication date: 20 June 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.6960
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Applications of universal algebra in computer science (08A70) Decidability of theories and sets of sentences (03B25)
Related Items (7)
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard ⋮ On regular paths with counting and data tests ⋮ Unnamed Item ⋮ The HOM Problem is EXPTIME-Complete ⋮ Parameterized complexity of basic decision problems for tree automata ⋮ Projection for Büchi Tree Automata with Constraints between Siblings ⋮ Emptiness and finiteness for tree automata with global reflexive disequality constraints
Uses Software
This page was built for publication: Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
