Parikh-reducing Church-Rosser representations for some classes of regular languages.
Tobias WalterPublished in: CoRR (2017)
Keyphrases
- regular languages
- context free languages
- grammatical inference
- regular expressions
- positive data
- finite automata
- decision problems
- context free grammars
- pac learning
- context free
- pattern matching
- finite state machines
- positive and negative
- equivalence queries
- inductive inference
- relational databases
- noisy data
- query language