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
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 sets of two-dimensional arrays, called here transducer generated languages, obtained by iterative applications of transducers (finite state automata with output). Each transducer generates a set of blocks of symbols such that 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 show how these arrays can be implemented through molecular assembly of triple crossover DNA molecules. Such assembly could serve as a scaffold for arranging molecular robotic arms capable of simultaneous movements. We observe that transducer generated languages define a class of languages which is a proper subclass of recognizable picture languages, but it contains the class of all factorial local two-dimensional languages. By taking the average growth rate of the number of blocks in the language as a measure of its complexity, we further observe that arrays with high complexity patterns can be generated in this way.