On inferring linear single-tree languages

DOI10.1016/S0020-0190(99)00157-XMaRDI QIDQ294705zbMATH OpenFDO

Authors Erkki Mäkinen

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

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

Recommendations

• scientific article; zbMATH DE number 2089362
• The inference of tree languages from finite samples: An algebraic approach
• scientific article; zbMATH DE number 845930
• scientific article; zbMATH DE number 176239
• Stochastic inference of regular tree languages
• The grammatical inference problem for the Szilard languages of linear grammars
• The partial clone of linear tree languages
• Semigroups of linear tree languages

Cites work

• scientific article; zbMATH DE number 176239 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Language identification in the limit
• Learning deterministic even linear languages from positive examples

Cited in

(7)

• scientific article; zbMATH DE number 176239 (Why is no real title available?)
• Error-correcting tree language inference
• The grammatical inference problem for the Szilard languages of linear grammars
• On some constructions of grammars for linear languages
• A note on inferring uniquely terminating code languages
• Learning Tree Languages
• The partial clone of linear tree languages

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

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