scientific article; zbMATH DE number 2019595

MaRDI QIDQ4440387zbMATH OpenFDO

Authors François Denis, Aurélien Lemay, Alain Terlutte

Publication date 17 December 2003

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Recommendations

• Learning approximately regular languages with reversible languages
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
• scientific article; zbMATH DE number 1104343
• scientific article; zbMATH DE number 2080444
• scientific article; zbMATH DE number 1301791

Cited in

(16)

• Learning approximately regular languages with reversible languages
• Identification of function distinguishable languages.
• Learning regular languages using RFSAs.
• Learnability of automatic classes
• Learning probabilistic automata using residuals
• Identification of birfsa languages.
• Automatic learners with feedback queries
• scientific article; zbMATH DE number 1670720 (Why is no real title available?)
• FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
• Learning Left-to-Right and Right-to-Left Iterative Languages
• String extension learning using lattices
• INFERENCE OF REVERSIBLE LANGUAGES
• Inferring regular languages by merging nonterminals
• scientific article; zbMATH DE number 1301791 (Why is no real title available?)
• scientific article; zbMATH DE number 1104343 (Why is no real title available?)
• scientific article; zbMATH DE number 2080444 (Why is no real title available?)

Describes a project that uses

Uses Software

• RFSA

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 Q4440387)