Computing the prefix of an automaton
Marie-Pierre Béal, Olivier Carton (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Marie-Pierre Béal, Olivier Carton (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Christiane Frougny (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Andrew Badr, Viliam Geffert, Ian Shipman (2009)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We present the first (polynomial-time) algorithm for reducing a given deterministic finite state automaton (DFA) into a hyper-minimized DFA, which may have fewer states than the classically minimized DFA. The price we pay is that the language recognized by the new machine can differ from the original on a finite number of inputs. These hyper-minimized automata are optimal, in the sense that every DFA with fewer states must disagree on infinitely many inputs. With small modifications,...
Pavol Ďuriš, Juraj Hromkovič (1987)
Kybernetika
Similarity:
Jean-Camille Birget (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: