Conservative groupoids recognize only regular languages.
Martin BeaudryDanny DubéMaxime DubéMario LatendressePascal TessonPublished in: Inf. Comput. (2014)
Keyphrases
- regular languages
- context free languages
- regular expressions
- grammatical inference
- finite automata
- decision problems
- context free grammars
- pac learning
- context free
- positive data
- pattern matching
- inductive inference
- learning theory
- theoretical analysis
- data model
- finite state machines
- statistical queries
- equivalence queries