scientific article; zbMATH DE number 176928

MaRDI QIDQ4036762zbMATH OpenFDO

Authors Takashi Yokomori

Publication date 18 May 1993

zbMATH Keywords

algorithminductive inference\(0L\) languages\(PD0L\) languagesidentifiability in the limit from positive data

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 996380
• scientific article; zbMATH DE number 3932417
• scientific article; zbMATH DE number 791077
• A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data
• scientific article; zbMATH DE number 2077185

Cited in

(7)

• scientific article; zbMATH DE number 1966625 (Why is no real title available?)
• On the union of 0L languages
• Minimal concept identification and reliability
• scientific article; zbMATH DE number 1395882 (Why is no real title available?)
• Elliptic curves and Fibonacci numbers arising from Lindenmayer system with symbolic computation
• scientific article; zbMATH DE number 996381 (Why is no real title available?)
• On the non-existence of maximal inference degrees for language identification

This page was built for publication:

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