Learning regular languages using RFSAs.

DOI10.1016/J.TCS.2003.11.008MaRDI QIDQ1426151zbMATH OpenOpenAlexFDO

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

Publication date 14 March 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2003.11.008

zbMATH Keywords

Finite state automataGrammatical inferenceMachine learningRegular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2080668
• scientific article; zbMATH DE number 1670711
• scientific article; zbMATH DE number 1886068
• scientific article; zbMATH DE number 1688359
• Implementation and Application of Automata

Cites work

• Characteristic sets for polynomial grammatical inference
• Complexity of automaton identification from given data
• Derivatives of Regular Expressions
• scientific article; zbMATH DE number 1670710 (Why is no real title available?)
• scientific article; zbMATH DE number 1670711 (Why is no real title available?)
• scientific article; zbMATH DE number 1688359 (Why is no real title available?)
• scientific article; zbMATH DE number 2019595 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1886068 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Learning regular sets from queries and counterexamples

Cited in

(20)

• On locally reversible languages
• Learning regular languages from counterexamples
• Weighted automata are compact and actively learnable
• Learning algorithms
• Learning residual alternating automata
• A sufficient condition to polynomially compute a minimum separating DFA
• Identification of birfsa languages.
• scientific article; zbMATH DE number 1670711 (Why is no real title available?)
• On the Inference of Finite State Automata from Positive and Negative Data
• A polynomial double reversal minimization algorithm for deterministic finite automata
• Polynomial characteristic sets for \(DFA\) identification
• scientific article; zbMATH DE number 2019596 (Why is no real title available?)
• scientific article; zbMATH DE number 2080668 (Why is no real title available?)
• Learning residual finite-state automata using observation tables
• Parallel algorithms for minimal nondeterministic finite automata inference
• Query learning algorithm for residual symbolic finite automata
• scientific article; zbMATH DE number 7559411 (Why is no real title available?)
• Implementation and Application of Automata
• Universal automata and NFA learning
• On the efficient construction of quasi-reversible automata for reversible languages

This page was built for publication: Learning regular languages using RFSAs.

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