Computer Science – Symbolic Computation
Scientific paper
2004-01-15
Computer Science
Symbolic Computation
13 decembre 2004
Scientific paper
We present here algebraic formulas associating a k-automaton to a
k-epsilon-automaton. The existence depends on the definition of the star of
matrices and of elements in the semiring k. For this reason, we present the
theorem which allows the transformation of k-epsilon-automata into k-automata.
The two automata have the same behaviour.
Duchamp Gérard
Kacem Hatem Hadj
Laugerotte Eric
No associations
LandOfFree
Algebraic Elimination of epsilon-transitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Algebraic Elimination of epsilon-transitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic Elimination of epsilon-transitions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-299977