Login / Signup
Lower bounds for the size of deterministic unranked tree automata.
Xiaoxue Piao
Kai Salomaa
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
tree automata
lower bound
regular expressions
regular tree languages
finite automata
finite state
upper bound
syntactic pattern recognition
tree languages
finite automaton
ordered trees
objective function
expert systems
markov chain
matching algorithm