Rabin Tree Automata and Finite Monoids.

Danièle Beauquier Andreas Podelski

Published in: MFCS (1993)

Keyphrases

tree automata
finite automata
closure properties
regular expressions
finite state
tree languages
grammatical inference
syntactic pattern recognition
finite automaton
context free grammars
context free
databases
markov chain
pattern matching