Efficient simulation of nondeterministic weighted finite automata

Authors:
Mark G. Eramian
Affiliations:
Department of Computer Science, The University of Saskatchewan, Saskatoon, Saskatchewan, Canada
Venue:
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Year:
2004

Citing 7
Cited 0

Systolic tree architecture for some standard functions

Computers and Artificial Intelligence
Grail: a C++ library for automata and expressions

Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Inference algorithms for WFA and image compression

Fractal image compression
Finite nondeterministic automata: simulation and minimality

Theoretical Computer Science
On the Determinization of Weighted Finite Automata

SIAM Journal on Computing
Dynamical Implementation of Nondeterministic Automata and Concurrent Systems

WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Tools to Implement Automata, a First Step: ASTL

WIA '97 Revised Papers from the Second International Workshop on Implementing Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Simulation of nondeterministic automata is often required in algorithms for string matching and image compression. We give three algorithms for NWFA simulation and compare them with known methods. When we consider the problem of computing the acceptance weight of all words of a given finite length, we find that the best of the three algorithms is comparable with a recursive version of a known sparse matrix based algorithm with respect to time, but offers an implementation with simpler data structures.