This paper begins by presenting a simple explanation of the main ideas in fractal image
compression. It then presents a brief discussion of the current state of the art along with …

Regular languages and finite automata are among the oldest topics in formal language
theory. The formal study of regular languages and finite automata can be traced back to the …

Abstract We introduce Weighted Finite Automata (WFA) as a tool to define real functions, in
particular, greyness functions of grey-tone images. Mathematical properties and the …

Digital Images and Formal Languages Page 1 Digital Images and Formal Languages Karel
Culik 11* and Jarkko Kari Summary. We discuss the application of (weighted) finite automata to …

A new application of finite automata as computers of real functions is introduced. It is shown
that even automata with a restricted structure compute all polynomials, many fractal-like and …

Jeffrey proposed (1990) a graphic representation of DNA sequences using Barnsley's
iterative function systems. In spite of further developments in this direction, the proposed …

A remark on morphic sturmian words Page 1 INFORMATIQUE THÉORIQUE ET
APPLICATIONS J. BERSTEL P. SÉÉBOLD A remark on morphic sturmian words …

The present work consists of two separate investigations into the quantitative measurement
of the complexity of performing some computational task. In the first chapter, the task is …

FINITE AUTOMATA BASED COMPRESSION OF BI-LEVEL AND SIMPLE COLOR IMAGES
Page 1 Pergamon Cornput. & Graphics, Vol. 21, No. I, pp. 6148, 1997 0 1997 Elsevier …

We consider classes of sets of r adic expansions of reals specified by means of the theory of
formai languages or automata theory It is shown how these spécifications are used to …