Recognizable picture languages
Parallel image processing
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
A small aperiodic set of Wang tiles
Discrete Mathematics
Handbook of formal languages, vol. 3
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Iterated Length-Preserving Rational Transductions
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
From determinism to non-determinism in recognizable two-dimensional languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Finite state automata representing two-dimensional subshifts
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Tiling automaton: a computational model for recognizable two-dimensional languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
| Hi-index | 0.00 |
We consider two-dimensional languages, called here 2d transducer languages, generated by iterative applications of transducers (finite state automata with output). To each transducer a two-dimensional language consisting of blocks of symbols is associated: the bottom row of a block is an input string accepted by the transducer and, by iterative application of the transducer, each row of the block is an output of the transducer on the preceding row. We observe that this class of languages is a proper subclass of recognizable picture languages containing the class of all factorial local 2d languages. By taking the average growth rate of the number of blocks in the language as a measure of its complexity, also known as the entropy of the language, we show that every entropy value of a one-dimensional regular language can be obtained as an entropy value of a 2d transducer language.