scientific article; zbMATH DE number 2080668

zbMATH Open1050.68058MaRDI QIDQ4473564FDOQ4473564

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (15)

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

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)