Computing the prefix of an automaton
Marie-Pierre Béal, Olivier Carton (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We present an algorithm for computing the prefix of an automaton. Automata considered are non-deterministic, labelled on words, and can have -transitions. The prefix automaton of an automaton has the following characteristic properties. It has the same graph as . Each accepting path has the same label as in . For each state , the longest common prefix of the labels of all paths going from to an initial or final state is empty. The interest of the computation of the prefix...