Some Regular Languages That Are Church-Rosser Congruential.
Gundula NiemannJohannes WaldmannPublished in: Developments in Language Theory (2001)
Keyphrases
- regular languages
- regular expressions
- context free languages
- grammatical inference
- finite automata
- decision problems
- context free grammars
- positive data
- pac learning
- finite state machines
- context free
- pattern matching
- inductive inference
- equivalence queries
- efficient learning
- statistical queries
- knowledge base
- hidden markov models