Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
Luis BarguñóCarles CreusGuillem GodoyFlorent JacquemardCamille VacherPublished in: Log. Methods Comput. Sci. (2013)
Keyphrases
- global constraints
- tree automata
- tree languages
- regular tree languages
- monadic second order logic
- regular expressions
- constraint programming
- weighted constraint satisfaction
- constraint satisfaction problems
- finite automata
- finite state
- integer programming
- arc consistency
- finite automaton
- parameterized complexity
- first order logic
- information extraction