A Unifying Kleene Theorem for Weighted Finite Automata

2011 ◽  
pp. 76-89 ◽  
Author(s):  
Zoltán Ésik ◽  
Werner Kuich
Keyword(s):  
Finite Automata ◽  
Weighted Finite Automata ◽  
Kleene Theorem

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.

Weighted Finite Automata Based Image Compression on Hadoop MapReduce Framework

2015 ◽  
Author(s):  
U.S.N. Raju ◽  
Irlanki Sandeep ◽  
Nattam Sai Karthik ◽  
Rayapudi Siva Praveen ◽  
Mayank Singh Sachan
Keyword(s):  
Image Compression ◽  
Finite Automata ◽  
Mapreduce Framework ◽  
Hadoop Mapreduce ◽  
Weighted Finite Automata

Languages Accepted by Integer Weighted Finite Automata

1999 ◽  
pp. 123-134 ◽  
Author(s):  
Vesa Halava ◽  
Tero Harju
Keyword(s):  
Finite Automata ◽  
Weighted Finite Automata

Fractal Coding Based Video Compression Using Weighted Finite Automata

2018 ◽  
Vol 9 (1) ◽  
pp. 115-133 ◽  
Author(s):  
Shailesh D. Kamble ◽  
Nileshsingh V. Thakur ◽  
Preeti R. Bajaj
Keyword(s):  
Video Compression ◽  
Signal To Noise Ratio ◽  
Finite Automata ◽  
Video Quality ◽  
Self Similarity ◽  
Fractal Coding ◽  
Time Compression ◽  
Practical Reality ◽  
Weighted Finite Automata ◽  
Evaluation Parameters

Main objective of the proposed work is to develop an approach for video coding based on Fractal coding using the weighted finite automata (WFA). The proposed work only focuses on reducing the encoding time as this is the basic limitation why the Fractal coding not becomes the practical reality. WFA is used for the coding as it behaves like the Fractal Coding (FC). WFA represents an image based on the idea of fractal that the image has self-similarity in itself. The plane WFA (applied on every frame), and Plane FC (applied on every frame) coding approaches are compared with each other. The experimentations are carried out on the standard uncompressed video databases, namely, Traffic, Paris, Bus, Akiyo, Mobile, Suzie etc. and on the recorded video, namely, Geometry and Circle. Developed approaches are compared on the basis of performance evaluation parameters, namely, encoding time, decoding time, compression ratio, compression percentage, bits per pixel and Peak Signal to Noise Ratio (PSNR). Though the initial number of states is 256 for every frame of all the types of videos, but we got the different number of states for different frames and it is quite obvious due to minimality of constructed WFA for respective frame. Based on the obtained results, it is observed that the number of states is more in videos namely, Traffic, Bus, Paris, Mobile, and Akiyo, therefore the reconstructed video quality is good in comparison with other videos namely, Circle, Suzie, and Geometry.

Quasi-Distances and Weighted Finite Automata

2017 ◽  
pp. 135-151
Author(s):  
Timothy Ng ◽  
David Rappaport ◽  
Kai Salomaa
Keyword(s):  
Finite Automata ◽  
Weighted Finite Automata

DETERMINATIONS OF WEIGHTED FINITE AUTOMATA OVER COMMUTATIVE IDEMPOTENT MF-SEMIRINGS

2012 ◽  
Vol 22 (03) ◽  
pp. 1250020
Author(s):  
YONG HE ◽  
GONGCAI XIN ◽  
ZHIXI WANG
Keyword(s):  
Finite Automaton ◽  
Finite Dimension ◽  
Finite Automata ◽  
Commutative Semiring ◽  
Special Cases ◽  
Weighted Finite Automata

The semirings admitting maximal factorizations of any finite dimension are called MF-semirings. We first show that a commutative semiring K is an MF-semiring if and only if K admits a maximal factorization of dimension n ≥ 2, and if and only if K is a multiplicatively cancellative semiring satisfying the g.c.d. condition. And then, by using above result, we prove that a weighted finite automaton [Formula: see text] over a commutative idempotent MF-semiring has a determination if [Formula: see text] has the victory property and twins property. Also, some special cases are considered.

STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA

2007 ◽  
Vol 18 (06) ◽  
pp. 1407-1416 ◽  
Author(s):  
KAI SALOMAA ◽  
PAUL SCHOFIELD
Keyword(s):  
Upper Bound ◽  
Finite Automaton ◽  
Regular Language ◽  
Finite Automata ◽  
The State ◽  
Deterministic Finite Automata ◽  
State Complexity ◽  
Weighted Finite Automata

It is known that the neighborhood of a regular language with respect to an additive distance is regular. We introduce an additive weighted finite automaton model that provides a conceptually simple way to reprove this result. We consider the state complexity of converting additive weighted finite automata to deterministic finite automata. As our main result we establish a tight upper bound for the state complexity of the conversion.

Sign in / Sign up

Export Citation Format

Share Document