scientific article; zbMATH DE number 1886068
From MaRDI portal
Publication:4799353
zbMath1011.68048MaRDI QIDQ4799353
Alain Terlutte, François Denis, Aurélien Lemay
Publication date: 19 March 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Learning probabilistic automata using residuals ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ A (co)algebraic theory of succinct automata ⋮ On the Inference of Finite State Automata from Positive and Negative Data ⋮ Unnamed Item ⋮ Learning regular languages using RFSAs. ⋮ Unnamed Item ⋮ Theory of átomata ⋮ On the efficient construction of quasi-reversible automata for reversible languages ⋮ Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited ⋮ On lexicographic representatives in braid monoids ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On locally reversible languages ⋮ Minimisation of automata ⋮ Learning algorithms ⋮ Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton ⋮ Yet another canonical nondeterministic automaton