On some structural properties of a subclass of ∞-regular languages.
Ivan MezníkPublished in: Discret. Appl. Math. (1987)
Keyphrases
- structural properties
- regular languages
- statistical queries
- context free languages
- grammatical inference
- regular expressions
- finite automata
- positive data
- pattern languages
- decision problems
- pac learning
- context free grammars
- lower bound
- finite state machines
- uniform distribution
- pattern matching
- boolean functions
- context free
- positive examples
- target function
- equivalence queries
- data model
- training set