The Removal of Weighted ε-Transitions
نویسندگان
چکیده
The removal of ε-transitions in weighted automata leads to infinite summation when cycles of such transitions are allowed. This paper presents both an algorithm for that purpose, and a framework in which the algorithm is correct.
منابع مشابه
Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton
Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring efficient ε-transitions-removal techniques. In this paper, we present new bounds on the number of new transitions for several ε-transitions-removal problems. We study the case of acyclic WFA. We introduce a new pro...
متن کاملPath-Equivalent Developments in Acyclic Weighted Automata
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient ε-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the ε-transitions-removal problem. ...
متن کاملA Coalgebraic View of ε-Transitions
In automata theory, a machine transitions from one state to the next when it reads an input symbol. It is common to also allow an automaton to transition without input, via an ε-transition. These ε-transitions are convenient, e.g., when one defines the composition of automata. However, they are not necessary, and can be eliminated. Such ε-elimination procedures have been studied separately for ...
متن کاملAlgebraic elimination of ε-transitions
We here describe a method of removing the ε-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 ε-tran...
متن کاملAlgebraic Elimination of epsilon-transitions
We here decribe a method of removing the ε-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 ε-trans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012