Some decidability results on grammatical inference and complexity

DOI10.1016/S0019-9958(72)90424-XzbMath0242.68053OpenAlexW2170275266MaRDI QIDQ5653577

Jerome A. Feldman

Publication date: 1972

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(72)90424-x

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (25)

Intrinsic complexity of learning geometrical concepts from positive data ⋮ `Ideal learning' of natural language: positive results about learning from positive evidence ⋮ Probability and plurality for aggregations of learning machines ⋮ Strongly non-U-shaped language learning results by general techniques ⋮ Prudence and other conditions on formal language learning ⋮ Learning Meaning Before Syntax ⋮ Learning recursive functions: A survey ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Confident and consistent partial learning of recursive functions ⋮ Learnability and positive equivalence relations ⋮ SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ On the power of inductive inference from good examples ⋮ Total complexity and the inference of best programs ⋮ Learnability and positive equivalence relations ⋮ Comparison of identification criteria for machine inductive inference ⋮ Classes of formal grammars ⋮ Sequential fuzzy system identification ⋮ Random Subgroups of Rationals ⋮ On the inference of Turing machines from sample computations ⋮ Approximation methods in inductive inference ⋮ Note on a central lemma for learning theory ⋮ On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings ⋮ Avoiding coding tricks by hyperrobust learning ⋮ Language learning from texts: Degrees of intrinsic complexity and their characterizations ⋮ Unnamed Item

This page was built for publication: Some decidability results on grammatical inference and complexity