A non-learnable class of E-pattern languages.
Daniel ReidenbachPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- pattern languages
- positive data
- inductive inference
- efficient learning
- formal language theory
- efficiently learnable
- hypothesis spaces
- regular patterns
- equivalence queries
- design patterns
- membership queries
- formal languages
- limit from positive data
- recursive functions
- hypothesis space
- tree patterns
- distributed systems
- database systems
- machine learning