-
Same authors
-
Related articles
- Recommend this article
- Download citation
- Alert me if this article is cited
- Alert me if this article is corrected
|
|||||||||||||||
DOI: 10.1051/ita:2000127
Theoret. Informatics Appl. 34 (2000) 503-514
Computing the prefix of an automaton
Marie-Pierre Béal
Institut Gaspard Monge,
Université de Marne-la-Vallée,
5 boulevard Descartes,
77454 Marne-la-Vallée Cedex 2, France;
(Marie-Pierre.Beal@univ-mlv.fr)
url: http://www-igm.univ-mlv.fr/~beal/
Olivier Carton
Institut Gaspard Monge,
Université de Marne-la-Vallée,
5 boulevard Descartes,
77454 Marne-la-Vallée Cedex 2, France;
(Olivier.Carton@univ-mlv.f)
url: http://www-igm.univ-mlv.fr/~carton/
Received May, 2000. Accepted February, 2001.
Abstract: 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 q, the longest common prefix of the
labels of all paths going from q to an initial or final state is empty.
The interest of the computation of the prefix of an automaton is that it
is the first step of the minimization of sequential transducers.
The algorithm that we describe has the same worst case time complexity as
another algorithm due to Mohri but our algorithm allows automata that
have empty labelled cycles. If we denote by P(q) the longest common
prefix of labels of paths going from q to an initial or final state, it
operates in time
where P is the maximal length of
all P(q).
AMS Subject Classification: 68Q45
Communicated by: Ch. Choffrut.
Copyright EDP Sciences
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook