On the classification of computable languages

DOI10.1007/BFb0023462zbMath1498.68133MaRDI QIDQ5048927

Arun Sharma, E. B. Kinber, John Case, Frank Stephan

Publication date: 9 November 2022

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

Mathematics Subject Classification ID

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

Related Items (3)

On learning of functions refutably. ⋮ On the classification of recursive languages ⋮ On the intrinsic complexity of learning recursive functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and non-monotonic inductive inference
• Automata on infinite words. Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984
• Classical recursion theory. The theory of functions and sets of natural numbers
• Some natural properties of strong-identification in inductive inference
• Classification using information
• Characterizations of monotonic and dual monotonic language learning
• Inductive inference of formal languages from positive data
• Inductive inference and unsolvability
• ON LEARNING LIMITING PROGRAMS
• Toward a mathematical theory of inductive inference
• Classifying Predicates and Languages
• Errata
• Decision problems forω-automata
• Definability in the monadic second-order theory of successor
• Language identification in the limit

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