RFSA
From MaRDI portal
Software:15847
No author found.
Related Items (14)
Learning probabilistic automata using residuals ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A polynomial double reversal minimization algorithm for deterministic finite automata ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ Polynomial characteristic sets for \(DFA\) identification ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ Unnamed Item ⋮ On the efficient construction of quasi-reversible automata for reversible languages ⋮ Grammatical Inference: Algorithms and Applications ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Machine Learning: ECML 2003 ⋮ On locally reversible languages
This page was built for software: RFSA
