Conservative Groupoids Recognize Only Regular Languages.
Danny DubéMario LatendressePascal TessonPublished in: LATA (2012)
Keyphrases
- regular languages
- context free languages
- regular expressions
- grammatical inference
- finite automata
- decision problems
- context free grammars
- positive data
- pac learning
- finite state machines
- context free
- pattern matching
- statistical queries
- uniform distribution
- learning algorithm
- context sensitive
- matching algorithm
- special case