Bounds for Tree Automata with Polynomial Costs.

Björn Borchardt Zoltán Fülöp Zsolt Gazdag Andreas Maletti

Published in: J. Autom. Lang. Comb. (2005)

Keyphrases

tree automata
regular expressions
finite state
finite automata
tree languages
syntactic pattern recognition
upper bound
finite automaton
lower bound
database
learning algorithm
context free grammars