RFSA
From MaRDI portal
RFSA Q15847
Cited in
(16)- On locally reversible languages
- Learning probabilistic automata using residuals
- libalf
- A sufficient condition to polynomially compute a minimum separating DFA
- EMILE
- Grammatical inference. Learning automata and grammars.
- A polynomial double reversal minimization algorithm for deterministic finite automata
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Polynomial characteristic sets for \(DFA\) identification
- scientific article; zbMATH DE number 2019595 (Why is no real title available?)
- scientific article; zbMATH DE number 2019596 (Why is no real title available?)
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
- Grammatical Inference: Algorithms and Applications
- Unambiguous automata inference by means of state-merging methods.
- Polynomial inference of universal automata from membership and equivalence queries
- On the efficient construction of quasi-reversible automata for reversible languages
This page was built for software: RFSA
