On Decidability of Theories of Regular Languages.
Sergey M. DudakovBoris KarlovPublished in: Theory Comput. Syst. (2021)
Keyphrases
- regular languages
- context free languages
- grammatical inference
- regular expressions
- finite automata
- decision problems
- context free grammars
- pac learning
- context free
- positive data
- finite state machines
- statistical queries
- equivalence queries
- query language
- xml schema
- relational databases
- efficient learning
- noisy data
- data integration
- special case