On the Strength of Unambiguous Tree Automata.

Henryk Michalewski Michal Skrzypczak

Published in: Int. J. Found. Comput. Sci. (2018)

Keyphrases

tree automata
regular expressions
finite automata
finite state
tree languages
syntactic pattern recognition
finite automaton
context free grammars
ordered trees
low level
markov chain
sufficient conditions
domain knowledge