Learning deterministic even linear languages from positive examples

DOI10.1016/S0304-3975(97)00016-9MaRDI QIDQ1390943zbMATH OpenFDO

Authors Takeshi Koshiba, Yuji Takada, Erkki Mäkinen

Publication date 22 July 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

learning algorithm\(k\)-reversible languages

Mathematics Subject Classification ID

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

Recommendations

• Learning strongly deterministic even linear languages from positive examples
• Learning regular languages from simple positive examples
• scientific article; zbMATH DE number 2019607
• Learning Linearly Separable Languages
• Learning languages from positive data and a limited number of short counterexamples
• Learning languages from positive data and negative counterexamples
• Algorithmic Learning Theory
• scientific article; zbMATH DE number 2089362
• scientific article; zbMATH DE number 2149593
• On Learning Languages from Positive Data and a Limited Number of Short Counterexamples

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 839340 (Why is no real title available?)
• scientific article; zbMATH DE number 845930 (Why is no real title available?)
• A hierarchy of language families learnable by regular language learning
• Efficiency of a Good But Not Linear Set Union Algorithm
• Grammatical inference for even linear languages based on control sets
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Language identification in the limit
• On a family of linear grammars

Cited in

(10)

• Identification with probability one of stochastic deterministic linear languages
• TeLEx: learning signal temporal logic from positive examples using tightness metric
• Efficient learning of tier-based strictly \(k\)-local languages
• scientific article; zbMATH DE number 2089362 (Why is no real title available?)
• On inferring linear single-tree languages
• Pattern computation in neural communication systems
• scientific article; zbMATH DE number 2019607 (Why is no real title available?)
• A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
• Even linear simple matrix languages: formal language properties and grammatical inference.
• Learning strongly deterministic even linear languages from positive examples

This page was built for publication: Learning deterministic even linear languages from positive examples

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