On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees.
David JaninGiacomo LenziPublished in: Comput. Artif. Intell. (2002)
Keyphrases
- finite automata
- regular languages
- decision trees
- tree automata
- expressive power
- language independent
- propositional logic
- picture languages
- tree structure
- fixed point
- grammatical inference
- databases
- queueing networks
- closure properties
- logical representation
- tree structured data
- tree models
- regular expressions
- relational query languages
- language identification
- topology preserving
- tree structures
- text summarization
- cross lingual