Learning approximately regular languages with reversible languages

DOI10.1016/S0304-3975(96)00224-1zbMath0908.68146MaRDI QIDQ1269920

Satoshi Kobayashi, Takashi Yokomori

Publication date: 22 October 1998

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

zbMATH Keywords

learning algorithmapproximately regular languages

Mathematics Subject Classification ID

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

Related Items (13)

Inferring descriptive generalisations of formal languages ⋮ Aspects of Reversibility for Classical Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Identification of function distinguishable languages. ⋮ Learning tree languages from text ⋮ Minimal Reversible Deterministic Finite Automata ⋮ Identification in the Limit of k,l-Substitutable Context-Free Languages ⋮ Learning and extending sublanguages ⋮ Reversible pushdown automata ⋮ Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data ⋮ Learning approximately regular languages with reversible languages ⋮ Learning with refutation ⋮ Descriptional complexity of regular languages

Cites Work

• Une topologie du monoide libre
• Learning approximately regular languages with reversible languages
• A theory of the learnable
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Language identification in the limit
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning approximately regular languages with reversible languages