Learning regular languages from counterexamples

DOI10.1016/0022-0000(91)90016-XMaRDI QIDQ1176104zbMATH OpenWikidataFDO

Authors Oscar H. Ibarra, Tao Jiang

Publication date 25 June 1992

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

regular languagespattern languagescounterexampleslearnability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Learning regular languages from simple positive examples
• Learning Regular Languages Using Nondeterministic Finite Automata
• scientific article; zbMATH DE number 1670711
• Learning approximately regular languages with reversible languages
• scientific article; zbMATH DE number 2080921
• scientific article; zbMATH DE number 2080668
• Learning Commutative Regular Languages
• Learning of Regular ω-Tree Languages
• Learning regular languages using RFSAs.
• Grammatical Inference: Algorithms and Applications

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• A note on the number of queries needed to identify regular languages
• A theory of the learnable
• Finding patterns common to a set of strings
• Identification of pattern languages from examples and queries
• Learning automata from ordered examples
• Learning regular sets from queries and counterexamples

Cited in

(13)

• Automatic symbolic compositional verification by learning assumptions
• Learning regular sets from queries and counterexamples
• Pattern languages with and without erasing
• On the learnability of recursively enumerable languages from good examples
• On the equivalence problem for E-pattern languages
• A hierarchy of language families learnable by regular language learning
• Automatic learning from positive data and negative counterexamples
• Inclusion is undecidable for pattern languages
• Learnability of automatic classes
• A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
• scientific article; zbMATH DE number 2040913 (Why is no real title available?)
• Even linear simple matrix languages: formal language properties and grammatical inference.
• scientific article; zbMATH DE number 2080921 (Why is no real title available?)

This page was built for publication: Learning regular languages from counterexamples

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