Share This Author
The aim of this chapter is to generalize concepts and techniques of formal language theory to two dimensions. Informally, a two-dimensional string is called a picture and is defined as a rectangular…
Codes and Automata
- A. Restivo
- Computer ScienceFormal Properties of Finite Automata and…
- 25 May 1987
This book is referred to read because it is an inspiring book to give you more chance to get experiences and also thoughts and it will show you the best book collections and completed collections.
Recognizable Picture Languages
A new notion of recognizability for picture (two-dimensional) languages is proposed extending the characterization of one-dimensional recognizable languages in terms of local languages and alphabetic mappings and the undecidability of the emptiness problem is proved.
Handbook of Formal Languages
Automata and Forbidden Words
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems
It is shown that a set of pictures is recognized by a finite tiling system iff it is definable in existential monadic second-order logic, which generalizes finite-state recognizability over strings and also matches a natural logic.
Burrows-Wheeler transform and Sturmian words
Overlap-free words on two symbols
Data compression using antidictionaries
- M. Crochemore, F. Mignosi, A. Restivo, S. Salemi
- Computer ScienceProceedings of the IEEE
- 1 November 2000
A new text-compression scheme based on forbidden words ("antidictionary") is given and it is proved that the algorithms attain the entropy for balanced binary sources and run in linear time.