Learning regular languages using RFSA

DOI10.1007/3-540-45583-3_26MaRDI QIDQ4473564zbMATH OpenFDO

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

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/2225/22250348.htm

Mathematics Subject Classification ID

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

Recommendations

• Learning regular languages using RFSAs.
• Learning regular languages using non deterministic finite automata
• scientific article; zbMATH DE number 1886068
• Residual finite state automata
• Implementation and Application of Automata

Cited in

(15)

• Learning regular languages from counterexamples
• Learning regular languages using RFSAs.
• RFSA
• Learning probabilistic automata using residuals
• Identification of birfsa languages.
• Learning regular languages using non deterministic finite automata
• Four one-shot learners for regular tree languages and their polynomial characterizability
• Learning probabilistic residual finite state automata
• Fast learning from strings of 2-letter rigid grammars
• Approximative learning of regular languages
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
• Learning residual finite-state automata using observation tables
• Generalization of the double-reversal method of finding a canonical residual finite state automaton
• Implementation and Application of Automata
• Polynomial inference of universal automata from membership and equivalence queries

This page was built for publication: Learning regular languages using RFSA

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