scientific article; zbMATH DE number 2080921

MaRDI QIDQ4473988zbMATH OpenFDO

Authors Henning Fernau

Publication date 4 August 2004

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

Mathematics Subject Classification ID

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

Recommendations

• Learning approximately regular languages with reversible languages
• Learning Regular Languages Using Nondeterministic Finite Automata
• scientific article; zbMATH DE number 1670711
• Grammatical Inference: Algorithms and Applications
• scientific article; zbMATH DE number 2080668
• Learning regular languages from counterexamples
• scientific article; zbMATH DE number 2090199
• Learning regular languages over large ordered alphabets
• Learning of Regular ω-Tree Languages

Cited in

(10)

• Learning regular languages from counterexamples
• Learning approximately regular languages with reversible languages
• Identification of function distinguishable languages.
• scientific article; zbMATH DE number 2019597 (Why is no real title available?)
• scientific article; zbMATH DE number 2019606 (Why is no real title available?)
• scientific article; zbMATH DE number 2080444 (Why is no real title available?)
• Learning subregular classes of languages with factored deterministic automata
• scientific article; zbMATH DE number 2090199 (Why is no real title available?)
• Learning of restricted RNLC graph languages
• Asymptotic approximation by regular languages

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