Ordering regular languages and automata: Complexity.
Giovanna D'AgostinoDavide MartincighAlberto PolicritiPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- regular languages
- decision problems
- regular expressions
- finite automata
- grammatical inference
- context free languages
- finite state automata
- computational complexity
- finite state machines
- context free
- pac learning
- statistical queries
- context free grammars
- positive data
- pattern matching
- worst case
- optimal policy
- object oriented
- np hard
- learning algorithm