Learning regular languages using RFSAs.

DOI10.1016/j.tcs.2003.11.008zbMath1059.68058OpenAlexW2095745830MaRDI QIDQ1426151

Aurélien Lemay, François Denis, 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

Machine learningRegular languagesGrammatical inferenceFinite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

A polynomial double reversal minimization algorithm for deterministic finite automata ⋮ On the Inference of Finite State Automata from Positive and Negative Data ⋮ Polynomial characteristic sets for \(DFA\) identification ⋮ Unnamed Item ⋮ Universal automata and NFA learning ⋮ On the efficient construction of quasi-reversible automata for reversible languages ⋮ Identification of birfsa languages. ⋮ Unnamed Item ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Weighted automata are compact and actively learnable ⋮ On locally reversible languages ⋮ Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference ⋮ Learning algorithms ⋮ Learning residual alternating automata

Cites Work

• Learning regular sets from queries and counterexamples
• Characteristic sets for polynomial grammatical inference
• Complexity of automaton identification from given data
• Derivatives of Regular Expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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