Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data

DOI10.1016/j.tcs.2006.05.032zbMath1100.68049OpenAlexW2091436052MaRDI QIDQ2508967

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

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

Related Items (2)

On the Inference of Finite State Automata from Positive and Negative Data ⋮ On locally reversible languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Languages of R-trivial monoids
• Learning approximately regular languages with reversible languages
• Right and left locally testable languages
• Finite semigroup varieties of the form V*D
• Locally testable languages
• Characterizations of locally testable events
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
• Language identification in the limit

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