Regular Languages Are Church-Rosser Congruential.
Volker DiekertManfred KufleitnerKlaus ReinhardtTobias WalterPublished in: ICALP (2) (2012)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- context free languages
- finite automata
- decision problems
- context free grammars
- pac learning
- positive data
- finite state machines
- pattern matching
- context free
- decision rules
- learning theory
- machine learning
- learning problems
- statistical queries
- theoretical analysis