Finite Automata Computing Real Functions
SIAM Journal on Computing
Inference algorithms for WFA and image compression
Fractal image compression
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On Computational Power of Weighted Finite Automata
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
On generalizations of weighted finite automata and graphics applications
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Ancient typefaces and parametric weighted finite automata
Rainbow of computer science
| Hi-index | 0.00 |
Weighted finite automata (WFA) are nondeterministic finite automata labeled with real weights on their edges and states. They compute real functions on the unit interval. Parametric weighted finite automata (PWFA) are weighted finite automata with a multi-dimensional codomain. The only completely smooth functions computable by WFA are polynomials, while PWFA are also able to compute the sine, cosine, exponential and logarithmic function. We will present methods for constructing PWFA computing basic shapes, Catmull-Rom splines, Bezier polynomials and B-splines. We show how these possibilities can be combined to obtain a figure drawing framework that is based on a very simple automaton model that has only the operations of sum, multiplication by a constant and iteration.