Deterministic and Game Separability for Regular Languages of Infinite Trees.
Lorenzo ClementeMichal SkrzypczakPublished in: ICALP (2021)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- finite automata
- context free languages
- decision problems
- context free grammars
- positive data
- pac learning
- decision trees
- finite state machines
- equivalence queries
- context free
- pattern matching
- learning algorithm
- reinforcement learning
- membership queries
- fixpoint
- computational complexity