Learning regular languages using RFSAs.
From MaRDI portal
Publication:1426151
DOI10.1016/j.tcs.2003.11.008zbMath1059.68058MaRDI 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
68Q45: Formal languages and automata
Related Items
Unnamed Item, Unnamed Item, Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference, A polynomial double reversal minimization algorithm for deterministic finite automata, Polynomial characteristic sets for \(DFA\) identification, Universal automata and NFA learning, On the efficient construction of quasi-reversible automata for reversible languages, On locally reversible languages, 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., On the Inference of Finite State Automata from Positive and Negative Data
Cites Work