Inductive inference of automata, functions and programs

DOI10.1090/TRANS2/109/18zbMath0375.62035OpenAlexW4235026945MaRDI QIDQ4155651

Ja. M. Barzdin'

Publication date: 1977

Published in: Twenty Lectures Delivered at the International Congress of Mathematicians in Vancouver, 1974 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/trans2/109/18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parametric inference (62F99) Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (17)

A solution to Wiehagen's thesis ⋮ Robust learning of automatic classes of languages ⋮ On the power of recursive optimizers ⋮ Learning secrets interactively. Dynamic modeling in inductive inference ⋮ Optimal language learning from positive data ⋮ Learning recursive functions: A survey ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Confident and consistent partial learning of recursive functions ⋮ Consistent and coherent learning with \(\delta \)-delay ⋮ Learnability of automatic classes ⋮ Hypothesis spaces for learning ⋮ On some open problems in reflective inductive inference ⋮ Learners based on transducers ⋮ On the power of probabilistic strategies in inductive inference ⋮ On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings ⋮ On the role of update constraints and text-types in iterative learning ⋮ Towards a map for incremental learning in the limit from positive and negative information

This page was built for publication: Inductive inference of automata, functions and programs