On the amount of nonconstructivity in learning formal languages from text

DOI10.1016/J.IC.2020.104668MaRDI QIDQ2051759zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Frank Stephan, Thomas Zeugmann

Publication date 25 November 2021

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

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.1043

zbMATH Keywords

formal languagesinductive inferencelearning in the limitnon-constructivity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On the amount of nonconstructivity in learning formal languages from positive data
• On the amount of nonconstructivity in learning recursive functions
• Amount of Nonconstructivity in Finite Automata
• The complexity of universal text-learners.
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA

Cites work

• Amount of nonconstructivity in deterministic finite automata
• Amount of Nonconstructivity in Finite Automata
• Automata that take advice
• Computational limits on team identification of languages
• Consequences of the provability of NP ⊆ P/poly
• Finding patterns common to a set of strings
• Generalization and specialization strategies for learning r. e. languages
• scientific article; zbMATH DE number 2077171 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3307567 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Learning indexed families of recursive languages from positive data: A survey
• Learning languages and functions by erasing
• Monotonic and non-monotonic inductive inference
• On the amount of nonconstructivity in learning formal languages from positive data
• On the amount of nonconstructivity in learning recursive functions
• Periodicity in generations of automata
• Proof systems that take advice
• Some remarks on the theory of graphs
• The Power of Pluralism for Automatic Program Synthesis
• Turing machines that take advice

Cited in

(7)

• The complexity of universal text-learners.
• Amount of nonconstructivity in deterministic finite automata
• On the amount of nonconstructivity in learning formal languages from positive data
• On the amount of nonconstructivity in learning recursive functions
• Amount of Nonconstructivity in Finite Automata
• The complexity of universal text-learners
• On computability and learnability of the pumping lemma function

This page was built for publication: On the amount of nonconstructivity in learning formal languages from text

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