On the classification of computable languages

DOI10.1007/BFB0023462MaRDI QIDQ5048927zbMATH OpenFDO

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

Publication date 9 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0023462

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Other Turing degree structures (03D28) Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• On the classification of recursive languages
• On one-sided versus two-sided classification
• Learning and classifying
• Classifying Predicates and Languages
• On an open problem in classification of languages

Cites work

• Automata on infinite words. Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984
• Characterizations of monotonic and dual monotonic language learning
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classification using information
• Classifying Predicates and Languages
• Decision problems forω-automata
• Definability in the monadic second-order theory of successor
• Errata
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• scientific article; zbMATH DE number 1233702 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3186871 (Why is no real title available?)
• Inductive inference and unsolvability
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Monotonic and non-monotonic inductive inference
• ON LEARNING LIMITING PROGRAMS
• Some natural properties of strong-identification in inductive inference
• Toward a mathematical theory of inductive inference

Cited in

(4)

• On the intrinsic complexity of learning recursive functions
• On learning of functions refutably.
• Classifying Predicates and Languages
• On the classification of recursive languages

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

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