Complexity of weak acceptance conditions in tree automata.

Jakub Neumann Andrzej Szepietowski Igor Walukiewicz

Published in: Inf. Process. Lett. (2002)

Keyphrases

tree automata
regular expressions
finite automata
sufficient conditions
finite state
tree languages
positive and negative
reinforcement learning
context free grammars
syntactic pattern recognition