Iterated transductions and efficient learning from positive data: A unifying view

DOI10.1007/978-3-540-45257-7_13MaRDI QIDQ2754010zbMATH OpenFDO

Authors Satoshi Kobayashi

Publication date 11 November 2001

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

Full work available at URL https://doi.org/10.1007/978-3-540-45257-7_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Locality, reversibility, and beyond: Learning languages from positive data
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
• Some classes of regular languages identifiable in the limit from positive data
• Simple flat languages: a learnable class in the limit from positive data
• Iterative Learning from Positive Data and Negative Counterexamples

Cited in

(7)

• Learning elementary formal systems with queries.
• Iterative learning from positive data and negative counterexamples
• Iterative Learning from Positive Data and Counters
• Identification in the Limit of k,l-Substitutable Context-Free Languages
• Learning with ordinal-bounded memory from positive data
• The study of learnability of the class of k-acceptable languages on Gold's learning model
• Iterated sequential transducers as language generating devices

This page was built for publication: Iterated transductions and efficient learning from positive data: A unifying view

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