A decomposition phenomenon peculiar to the tessellation automata (TA) is investigated. The result is that, in scope-three TA with an arbitrary number of states, any finite pattern can be transformed to a standard pattern by repeated applications of inverse maps of two specific global maps
AbstractTessellation structures that reproduce arbitrary patterns are special cases of tessellation ...
If T is the parallel map associated with a 1-dimensional tessellation automaton, then we say a confi...
n a formula expressing how a specific picture language can be obtained from elementary languages by ...
A decomposition phenomenon peculiar to the tessellation automata (TA) is investigated. The result is...
AbstractIn this paper we obtain the following two results about one-dimensional tessellation automat...
Amoroso and Cooper have shown that for an arbitrary state alphabet A, one- and two-dimensional tesse...
Certain mathematical studies of pattern recognition, evolution theories, and self-reproducing automa...
In this report we deal with the question of whether or not, for a given tessellation automaton, ther...
This report deals with the question of whether or not, for a given tessellationautomaton, there exis...
In this paper, it is shown that if k≥3, any finite k-symbols pattern whose lengthis greater than 1 c...
The completeness problem for tessellation automata is the question of whether or not, for a given te...
A group tessellation automaton (TA) is one whose state alphabet consists of the elements of a group,...
For an arbitrary state alphabet A, one- and two-dimensional tessellation structures are defined that...
AbstractWe construct a reversible, one-dimensional cellular automaton that has the property that a f...
In this paper, we introduce two notions of being “balanced” and being “hard.” And we prove that thes...
AbstractTessellation structures that reproduce arbitrary patterns are special cases of tessellation ...
If T is the parallel map associated with a 1-dimensional tessellation automaton, then we say a confi...
n a formula expressing how a specific picture language can be obtained from elementary languages by ...
A decomposition phenomenon peculiar to the tessellation automata (TA) is investigated. The result is...
AbstractIn this paper we obtain the following two results about one-dimensional tessellation automat...
Amoroso and Cooper have shown that for an arbitrary state alphabet A, one- and two-dimensional tesse...
Certain mathematical studies of pattern recognition, evolution theories, and self-reproducing automa...
In this report we deal with the question of whether or not, for a given tessellation automaton, ther...
This report deals with the question of whether or not, for a given tessellationautomaton, there exis...
In this paper, it is shown that if k≥3, any finite k-symbols pattern whose lengthis greater than 1 c...
The completeness problem for tessellation automata is the question of whether or not, for a given te...
A group tessellation automaton (TA) is one whose state alphabet consists of the elements of a group,...
For an arbitrary state alphabet A, one- and two-dimensional tessellation structures are defined that...
AbstractWe construct a reversible, one-dimensional cellular automaton that has the property that a f...
In this paper, we introduce two notions of being “balanced” and being “hard.” And we prove that thes...
AbstractTessellation structures that reproduce arbitrary patterns are special cases of tessellation ...
If T is the parallel map associated with a 1-dimensional tessellation automaton, then we say a confi...
n a formula expressing how a specific picture language can be obtained from elementary languages by ...
DOI
Add to ORKG