A positive extension of Eilenberg's variety theorem for non-regular languages.
A. CanoJ. CanteroAna Martínez-PastorPublished in: Appl. Algebra Eng. Commun. Comput. (2021)
Keyphrases
- regular languages
- positive data
- context free languages
- grammatical inference
- regular expressions
- finite automata
- positive and negative
- context free grammars
- statistical queries
- decision problems
- context free
- pattern languages
- pac learning
- machine learning
- positive examples
- finite state machines
- relational databases
- learning algorithm