Learning strongly deterministic even linear languages from positive examples

DOI10.1007/3-540-60454-5_27zbMath1527.68108OpenAlexW1513675647MaRDI QIDQ6061884

Takeshi Koshiba, Erkki Maekinen, Yuji Takada

Publication date: 8 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60454-5_27

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Grammatical inference for even linear languages based on control sets
• A hierarchy of language families learnable by regular language learning
• Inference of Reversible Languages
• Efficiency of a Good But Not Linear Set Union Algorithm
• On a family of linear grammars
• Language identification in the limit

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