On inferring linear single-tree languages

DOI10.1016/S0020-0190(99)00157-XzbMath1339.68133MaRDI QIDQ294705

Erkki Maekinen

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909900157X?np=y

zbMATH Keywords

formal languagesgrammatical inferenceidentification in the limitlinear single-tree languages

Mathematics Subject Classification ID

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

Related Items (1)

Learning Tree Languages

Cites Work

• Learning deterministic even linear languages from positive examples
• Language identification in the limit
• Unnamed Item
• Unnamed Item

This page was built for publication: On inferring linear single-tree languages