On the amount of nonconstructivity in learning formal languages from positive data

DOI10.1007/978-3-642-29952-0_41MaRDI QIDQ2898054zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Frank Stephan, Thomas Zeugmann

Publication date 16 July 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-29952-0_41

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• On the amount of nonconstructivity in learning formal languages from text
• On the amount of nonconstructivity in learning recursive functions
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
• Learning languages from positive data and negative counterexamples
• Amount of Nonconstructivity in Finite Automata

Cited in

(10)

• Amount of Nonconstructivity in Finite Automata
• On reliability and refutability in nonconstructive identification
• scientific article; zbMATH DE number 996381 (Why is no real title available?)
• On computability and learnability of the pumping lemma function
• On the amount of nonconstructivity in learning recursive functions
• On the amount of nonconstructivity in learning formal languages from text
• Algorithmic Learning Theory
• Inferring pure context-free languages from positive data
• A family of languages which is polynomial-time learnable from positive data in pitt's sense
• Amount of nonconstructivity in deterministic finite automata

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

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