swMATH3315MaRDI QIDQ15847FDOQ15847
Author name not available (Why is that?)
Official website: http://www.springerlink.com/content/r6bf491t65b7crby/fulltext.pdf
Cited In (16)
- On locally reversible languages
- On the efficient construction of quasi-reversible automata for reversible languages
- Learning probabilistic automata using residuals
- Polynomial characteristic sets for \(DFA\) identification
- A sufficient condition to polynomially compute a minimum separating DFA
- Grammatical Inference: Algorithms and Applications
- Title not available (Why is that?)
- libalf
- Polynomial inference of universal automata from membership and equivalence queries
- EMILE
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
- Unambiguous automata inference by means of state-merging methods.
- 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
- Title not available (Why is that?)
This page was built for software: RFSA
