Some decidability results on grammatical inference and complexity
From MaRDI portal
Publication:5653577
Cited in
(26)- Confident and consistent partial learning of recursive functions
- Learnability and positive equivalence relations
- Approximation methods in inductive inference
- Strongly non-U-shaped language learning results by general techniques
- Sequential fuzzy system identification
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
- Learning recursive functions: A survey
- Probability and plurality for aggregations of learning machines
- Language learning from texts: Degrees of intrinsic complexity and their characterizations
- scientific article; zbMATH DE number 3503215 (Why is no real title available?)
- Avoiding coding tricks by hyperrobust learning
- Secretive interaction. Players and strategies
- Learning Meaning Before Syntax
- Classes of formal grammars
- On the power of inductive inference from good examples
- Random Subgroups of Rationals
- Prudence and other conditions on formal language learning
- Learnability and positive equivalence relations
- Learning indexed families of recursive languages from positive data: A survey
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
- Note on a central lemma for learning theory
- Comparison of identification criteria for machine inductive inference
- `Ideal learning' of natural language: positive results about learning from positive evidence
- Total complexity and the inference of best programs
- On the inference of Turing machines from sample computations
- Intrinsic complexity of learning geometrical concepts from positive data
This page was built for publication: Some decidability results on grammatical inference and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653577)
