A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata.
Emanuela FachiniAngelo MontiPublished in: J. Comput. Syst. Sci. (1994)
Keyphrases
- tree automata
- regular expressions
- closure properties
- regular tree languages
- tree languages
- finite automata
- context free grammars
- pattern matching
- expressive power
- query language
- context free
- finite state
- grammatical inference
- xml schema
- finite automaton
- syntactic pattern recognition
- matching algorithm
- data complexity
- propositional logic
- knowledge based systems
- object oriented
- knowledge representation
- information retrieval