A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra.
Mikolaj BojanczykBartek KlinPublished in: Log. Methods Comput. Sci. (2019)
Keyphrases
- regular languages
- finite automata
- tree automata
- regular expressions
- grammatical inference
- real numbers
- algebraic expressions
- decision trees
- query language
- pairwise
- finite sets
- machine learning
- algebraic operations
- relational algebra
- programming language
- picture languages
- tree structure
- context free
- tree structures
- language processing
- boolean algebra
- data model
- database systems
- databases