Beyond EDSM

DOI10.1007/3-540-45790-9_4MaRDI QIDQ4440384zbMATH OpenFDO

Authors Orlando Cicchello, Stefan Kremer

Publication date 17 December 2003

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/2484/24840037.htm

Mathematics Subject Classification ID

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

Recommendations

• Grammatical Inference: Algorithms and Applications
• Learning automata teams
• Learning automata from ordered examples
• Inference of regular languages using state merging algorithms with search
• Learning Regular Languages Using Nondeterministic Finite Automata

Cited in

(4)

• Repairing normal EDAs with selective repopulation
• Inducing Regular Languages Using Grammar-Based Classifier System
• Grammatical Inference: Algorithms and Applications
• Universal automata and NFA learning

This page was built for publication: Beyond EDSM

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