Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata.
Dana AngluinTimos AntonopoulosDana FismanNevin GeorgePublished in: FoSSaCS (2022)
Keyphrases
- regular languages
- regular expressions
- finite automata
- grammatical inference
- context free languages
- decision problems
- pac learning
- positive data
- finite state automata
- context free grammars
- pattern matching
- n gram
- finite state machines
- statistical queries
- uniform distribution
- context free
- machine learning
- hidden markov models