Learning in varieties of the form V^*LI from positive data

DOI10.1016/J.TCS.2006.05.032MaRDI QIDQ2508967zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 20 October 2006

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

Full work available at URL https://doi.org/10.1016/j.tcs.2006.05.032

zbMATH Keywords

grammatical inferencevarieties of languages

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 2019607
• INFERENCE OF REVERSIBLE LANGUAGES
• scientific article; zbMATH DE number 1301791
• scientific article; zbMATH DE number 2019602
• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data

Cites work

• Characterizations of locally testable events
• Finite semigroup varieties of the form V*D
• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 618821 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Language identification in the limit
• Languages of R-trivial monoids
• Learning approximately regular languages with reversible languages
• Locally testable languages
• Right and left locally testable languages
• THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS

Cited in

(3)

• On locally reversible languages
• On the Inference of Finite State Automata from Positive and Negative Data
• Grammatical Inference: Algorithms and Applications

This page was built for publication: Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data

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