Closure of Tree Automata Languages under Innermost Rewriting.
Adrià GascónGuillem GodoyFlorent JacquemardPublished in: Electron. Notes Theor. Comput. Sci. (2009)
Keyphrases
- tree automata
- closure properties
- regular expressions
- regular path queries
- finite automata
- finite state
- tree languages
- regular tree languages
- syntactic pattern recognition
- conjunctive queries
- grammatical inference
- context free grammars
- expressive power
- pattern matching
- database
- finite automaton
- context free
- query language
- query evaluation