Valuations of Weighted Automata: Doing It in a Rational Way

2011 ◽  
pp. 309-346 ◽  
Author(s):  
Ingmar Meinecke
Keyword(s):  
Weighted Automata

scholarly journals Modeling of safe time Petri nets by interval weighted automata

2020 ◽  
Vol 53 (4) ◽  
pp. 187-192
Author(s):  
Jan Komenda ◽  
Aiwen Lai ◽  
José Godoy Soto ◽  
Sébastien Lahaye ◽  
Jean-louis Boimond
Keyword(s):  
Petri Nets ◽  
Time Petri Nets ◽  
Weighted Automata

scholarly journals Nested Weighted Automata

2017 ◽  
Vol 18 (4) ◽  
pp. 1-44 ◽  
Author(s):  
Krishnendu Chatterjee ◽  
Thomas A. Henzinger ◽  
Jan Otop
Keyword(s):  
Weighted Automata

scholarly journals PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 799-811
Author(s):  
MATHIEU GIRAUD ◽  
PHILLIPE VEBER ◽  
DOMINIQUE LAVENIER
Keyword(s):  
Surface Area ◽  
Finite Automata ◽  
Clock Frequency ◽  
Partial Removal ◽  
Frequency Constraints ◽  
Weighted Automata ◽  
Weighted Finite Automata ◽  
Special Case

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. We introduce a new problem, a partial removal of ∊-transitions while accepting short chains of ∊-transitions.

scholarly journals Singular value automata and approximate minimization

2019 ◽  
Vol 29 (9) ◽  
pp. 1444-1478 ◽  
Author(s):  
Borja Balle ◽  
Prakash Panangaden ◽  
Doina Precup
Keyword(s):  
Singular Value Decomposition ◽  
Finite Rank ◽  
Singular Value ◽  
Linear Operators ◽  
Hankel Matrices ◽  
Weighted Automata ◽  
Approximate Minimization ◽  
Value Decomposition ◽  
Svd Decomposition

AbstractThe present paper uses spectral theory of linear operators to construct approximatelyminimal realizations of weighted languages. Our new contributions are: (i) a new algorithm for the singular value decomposition (SVD) decomposition of finite-rank infinite Hankel matrices based on their representation in terms of weighted automata, (ii) a new canonical form for weighted automata arising from the SVD of its corresponding Hankelmatrix, and (iii) an algorithmto construct approximateminimizations of given weighted automata by truncating the canonical form.We give bounds on the quality of our approximation.

Sign in / Sign up

Export Citation Format

Share Document