Approximative learning of regular languages

DOI10.1007/3-540-45627-9_19MaRDI QIDQ4473988zbMATH 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/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
• Learning regular languages using non deterministic finite automata
• Grammatical Inference: Algorithms and Applications
• Learning regular languages using RFSA
• Learning regular languages from counterexamples
• Algorithms for learning function distinguishable regular languages
• 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.
• Fragmentation: Enhancing identifiability
• Fast learning from strings of 2-letter rigid grammars
• Identification of function distinguishable languages
• Learning subregular classes of languages with factored deterministic automata
• Algorithms for learning function distinguishable regular languages
• Learning of restricted RNLC graph languages
• Asymptotic approximation by regular languages

This page was built for publication: Approximative learning of regular languages

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