Parikh-reducing Church-Rosser representations for some classes of regular languages.
Tobias WalterPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- regular languages
- context free languages
- regular expressions
- grammatical inference
- positive data
- finite automata
- decision problems
- context free grammars
- context free
- pac learning
- finite state machines
- positive and negative
- pac learnable
- statistical queries
- equivalence queries
- context sensitive
- learning tasks
- active learning
- data model
- training data