A non-regular language of infinite trees that is recognizable by a finite algebra.
Mikolaj BojanczykBartek KlinPublished in: CoRR (2018)
Keyphrases
- regular languages
- finite automata
- tree automata
- regular expressions
- grammatical inference
- real numbers
- query language
- algebraic expressions
- relational databases
- tree structure
- programming language
- finite sets
- tree languages
- decision trees
- object oriented programming
- language learning
- modeling language
- specification language
- description logics
- object oriented
- object identity
- linear temporal logic