Identification of function distinguishable languages

DOI10.1007/3-540-40992-0_9MaRDI QIDQ4473235zbMATH OpenFDO

Authors Henning Fernau

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1968/19680116.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• Identification of function distinguishable languages.
• Approximative learning of regular languages
• Algorithms for learning function distinguishable regular languages
• Some classes of regular languages identifiable in the limit from positive data
• Learning tree languages from text

Cited in

(6)

• Identification of function distinguishable languages.
• Identifying terminal distinguishable languages
• Identification of birfsa languages.
• Some classes of regular languages identifiable in the limit from positive data
• Fragmentation: Enhancing identifiability
• Algorithms for learning function distinguishable regular languages

This page was built for publication: Identification of function distinguishable languages

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