Ideal regular languages and strongly connected synchronizing automata.
Rogério ReisEmanuele RodaroPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- regular languages
- strongly connected
- regular expressions
- finite automata
- grammatical inference
- context free languages
- decision problems
- directed graph
- context free grammars
- finite state automata
- positive data
- finite state machines
- pac learning
- pattern matching
- undirected graph
- computational complexity
- context free
- uniform distribution
- positive and negative
- query language