On Closure under Complementation of Equational Tree Automata for Theories Extending AC.

Kumar Neeraj Verma

Published in: LPAR (2003)

Keyphrases

tree automata
closure properties
equational theories
finite automata
regular expressions
finite state
tree languages
syntactic pattern recognition
theorem proving
finite automaton
context free grammars
information extraction
pattern matching
arc consistency