scientific article; zbMATH DE number 2019592

MaRDI QIDQ4440382zbMATH OpenFDO

Authors

Publication date 17 December 2003

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

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Grammatical Inference: Algorithms and Applications
• Learning Regular Languages Using Nondeterministic Finite Automata
• A Family of Algorithms for Non Deterministic Regular Languages Inference
• Inferring uniquely terminating regular languages from positive data
• Inferring regular trace languages from positive and negative samples

Cited in

(1)

• Grammatical Inference: Algorithms and Applications

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