Name
Abstract | ||
|---|---|---|
We here describe a method of removing the epsilon-transitions of a weighted automaton. The existence of a solution for this removal depends on the existence of the star of a single matrix which, in turn, is based on the computation of the stars of scalars in the ground semiring. We discuss two aspects of the star problem ( by infinite sums and by equations) and give an algorithm to suppress the epsilon-transitions and preserve the behaviour. Running complexities are computed. |
Year | Venue | Keywords |
|---|---|---|
2004 | DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | automata with multiplicities, epsilon-transitions, behaviour, star of matrices |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Algebraic number,Algebra,Matrix (mathematics),Automaton,Mathematics,Semiring | Journal | 7 |
Issue | ISSN | Citations |
1 | 1365-8050 | 1 |
PageRank | References | Authors |
0.36 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gérard Duchamp | 1 | 65 | 17.03 |
| Hatem Hadj Kacem | 2 | 47 | 14.43 |
| Éric Laugerotte | 3 | 12 | 2.98 |