An algebraic characterization of deterministic regular languages over infinite alphabets.
Nissim FrancezMichael KaminskiPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- regular languages
- regular expressions
- grammatical inference
- context free languages
- finite automata
- decision problems
- context free grammars
- positive data
- pac learning
- finite state machines
- pattern matching
- context free
- training data
- special case
- inductive inference
- statistical queries
- machine learning
- np hard
- objective function
- xml schema
- integrity constraints
- query language
- dynamic programming