On the classification of recursive languages

DOI10.1016/J.IC.2004.03.001zbMATH Open1074.68030OpenAlexW2028185140MaRDI QIDQ598240FDOQ598240

Authors: John Case, A. K. Sharma, Frank Stephan, Efim Kinber 

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.ic.2004.03.001

Recommendations

• On the classification of computable languages
• On one-sided versus two-sided classification
• Classifying Predicates and Languages
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Investigations on measure-one identification of classes of languages

zbMATH Keywords

structural complexityinductive learningTuring degrees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Other Turing degree structures (03D28)

Cites Work

• Some natural properties of strong-identification in inductive inference
• Inductive inference of formal languages from positive data
• Title not available (Why is that?)
• Toward a mathematical theory of inductive inference
• Title not available (Why is that?)
• Language identification in the limit
• Monotonic and non-monotonic inductive inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical recursion theory. The theory of functions and sets of natural numbers
• Characterizations of monotonic and dual monotonic language learning
• Inductive inference and unsolvability
• Testing and generating infinite sequences by a finite automaton
• On one-sided versus two-sided classification
• Generalized notions of mind change complexity
• Title not available (Why is that?)
• Comparison of identification criteria for machine inductive inference
• Title not available (Why is that?)
• The degrees of bi‐immune sets
• Classification using information
• Classifying Predicates and Languages
• Generalization versus classification
• Decision problems forω-automata
• Recursively enumerable sets of positive integers and their decision problems
• Title not available (Why is that?)
• On the role of procrastination in machine learning
• Ordinal mind change complexity of language identification
• Definability in the monadic second-order theory of successor
• Can finite samples detect singularities of real-valued functions?
• ON LEARNING LIMITING PROGRAMS
• Machine learning of higher-order programs
• Title not available (Why is that?)
• On the classification of computable languages
• Elementary formal systems, intrinsic complexity, and procrastination

Cited In (5)

• Learning and classifying
• On some properties of a linguistic classifier
• On the classification of computable languages
• Enlarging learnable classes
• Inferring answers to queries

This page was built for publication: On the classification of recursive languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598240)