Deciding FO-definability of Regular Languages.
Agi KuruczVladislav RyzhikovYury SavateevMichael ZakharyaschevPublished in: CoRR (2021)
Keyphrases
- special case
- regular languages
- context free languages
- regular expressions
- grammatical inference
- finite automata
- fixpoint
- decision problems
- context free grammars
- first order logic
- positive data
- finite state machines
- pac learning
- query language
- logic programs
- pattern matching
- context free
- statistical queries
- machine learning
- learning theory
- query evaluation
- learning problems
- knowledge based systems
- model selection