scientific article; zbMATH DE number 2080668

MaRDI QIDQ4473564zbMATH OpenFDO

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

Publication date 4 August 2004

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

Mathematics Subject Classification ID

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

Recommendations

• Learning regular languages using RFSAs.
• scientific article; zbMATH DE number 1670711
• scientific article; zbMATH DE number 1886068
• scientific article; zbMATH DE number 1688359
• Implementation and Application of Automata

Cited in

(15)

• Learning probabilistic automata using residuals
• Implementation and Application of Automata
• scientific article; zbMATH DE number 2019606 (Why is no real title available?)
• Generalization of the double-reversal method of finding a canonical residual finite state automaton
• Learning regular languages from counterexamples
• RFSA
• Polynomial inference of universal automata from membership and equivalence queries
• Four one-shot learners for regular tree languages and their polynomial characterizability
• Learning regular languages using RFSAs.
• Identification of birfsa languages.
• scientific article; zbMATH DE number 2080921 (Why is no real title available?)
• scientific article; zbMATH DE number 2019596 (Why is no real title available?)
• scientific article; zbMATH DE number 1670711 (Why is no real title available?)
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
• Learning residual finite-state automata using observation tables

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