Graphematic System of Cellular Automata

Short characterization of cellular automata by the 9 graphematic levels of inscription

Rudolf Kaehr Dr.phil@

Copyright ThinkArt Lab ISSN 2041-4358

 

Abstract

As a further specification of the “overview of morphic cellular automata”, described before, a graphematic classification of the inscriptional systems shall be introduced and applied to different types of cellular automata. The combinatory aspects of the classification of mappings are based on Dieter Schadach’s work, this work is cited but not fully reconstructed, proofs are omitted and referred to the original work.

1.  A system of types of inscriptions

1.1.  Schadach’s complete classification of mappings

1.1.1.  Systems of classifications

When Gotthard Gunther was forced in the early ‘60s to abandon his multiple-valued approach in favor of a kenogrammatic radicalization of his ideas towards a trans-classical logic, the question immediately raised about what kind of mathematical system could be behind his kenogramatics he introduced intuitively.

Of the different approaches at that time at the BCL (Biological Computer Laboratory, Urbana, Ill., USA) to develop a mathematical foundation to support Gunther’s trans-classical studies towards kenogrammatics, the mathematical work of his assistant Dieter Schadach was of great importance. Schadach, supported by Heinz von Foerster and Alex Adrew, developed a general method of classification of mappings between sets which offered methods to determine combinatorial questions specific to the trans-classical project and was able to open up different new strategies and methods of trans-classical keno- and morhogrammatics and speculations about the deep structure of time and logic for evolving/emanating historical systems.

One point was to question: How many different levels exist in the classification of the whole system of kenogrammatics?

The other important question was: What is replacing the atomic elements of sets and sequences in the kenogrammatic settings, especially on the level of trito-grams?

A further important question appeared. Given the classification: How many sign sequences are represented on a level of such a classification? Especially, how many sign sequences are represented by an arbitrary tritogram?

Many other serious questions raised especially with the combinatorics of morphogrammatic compound systems for the foundation of multi-valued trans-classical logics. This question was profoundly answered with the dissertation of H. S. H. Na, “On structural analysis of many valued logics”, 1964.

All the approaches to further analysis by Heinz von Foerster, Na and Schadach had been based naturally on set-theoretical methods of mappings between sets, reasonable for combinatory studies, therefore, all the approaches had been based semiotically on the identity of its elements. The basics of this approach are defined by identical signs delivered as sets, multi-sets, heaps or different kinds of sequences of identical signs.

After all this combinatorial work had been done and has found a readable reconstruction and implementation in the book “Morphogrammatik” (Kaehr, Mahler) it seems to be appropriate to invent a more dynamic approach to classification. Instead of starting with semiotic identity it could be interesting to find a beginning in any other conceptual level of inscription, and therefore establishing a dynamical system of classification of scriptural praxis.

A first step towards a ‘beginning’ of a semiotic economy not based on identity is proposed by the Stirling Turn, which is starting with tritograms, i.e. with keno- and morphograms of the trito-structure of kenogrammatics.

Monomorphies
The question about a replacment of semiotic atoms, elements or objects of the semiotic identitive level of classification was given by Schadach’s concept of monomorphies of morphograms for the trito-level of kenogrammatic systems.

Gunther himself introduced 3 kenogramamtic levels of classification, trito-, deutero- and proto-structure, what produced an interesting debate because Schadach’s formal classification of mappings between sets contained 8 different levels, 4 specific independent levels plus identity and cardinality building together with the 3 mixed levels a similar structure like the 10-fold Sephirot of Kabbalah. On the other hand, Gunther’s classification got just 3 kenogrammatic levels plus identity and cardinality.

The solution to this discrepancy is quiet simple. Both are arguing on different classificational principles. Gunther on strict kenogrammatic properties involving the base set, A/Kern μi, of mappings only, while Schadach’s classification is based on on the whole system of set-theoretical mappings.

Schadach’s classification contains additionally to Gunther’s 3 independent levels, proto-, deutero- and trito-structure, 2 further independent levels which didn’t get a logical or philosophical interpretation.

Indicational semiotics
An interesting interpretation of a non-kenogrammatic level in Schadach’s system of classification became accessible with Mathias Varga von Kibéd and Rudi Matzka’s semiotic understanding of George Spencer-Brown’s Calculus of Indication as a ‘topology-invariant” semiotic system. Therefore, this level is based on identity but is abstracting from the order of its identical signs. This corresponds to Schadach’s independent level BAtypeset structure with the property δ and the cardinality typeset structure. The name of this number series is not yet mentioned.

"Diese drei Unterscheidungsmerkmale, also
a) die Verwendung leerer Symbole
b) die topologisch invariante Notation (und damit die Reihenfolgeunabhängigkeit der Argumente des Operators) und
c) die Nicht-stelligkeit des Operators,
erlauben prinzipiell nicht, von einer vollständigen Isomorphie der Kalküle von Spencer Brown mit gängigen formalen Systemen zu sprechen.” (Kibed, Matzka)

The fact, that the indicational level is proven by Schadach as an independent classification in the system of classification of mappings gives the adventure of George Spencer Brown and his Laws of Form a scientific foundation and legitimation not achieved by other attempts to justify the calculus of indication.

It also makes clear that any attempt to domesticate indication by propositional logics and linguistic-based semiotics obsolete. But it also shows at the same time clearly the radical limitation of the Laws of Form to a “binary” concept of indication which is denying the available richness of indicational symbolizations.

What was not seen by Brown and the Brownians is the even legitimate “complementary” system of symbolization or indication by the system based on the Mersenne numbers

Mersenne semiotics
The second independent level not reflected in Gunther’s kenogrammatics is the level BAtypeset structure with the property ε and the cardinality typeset structure. This level corresponds combinatorically to the Mersenne numbers. It delivers the inscriptual base for a Mersenne semiotics, logic and arithmetics complementary to the indicational semiotics, logic and arithmetics still to be elaborated.
Mersenne numbers and perfect Mersenne numbers played an important role in Gunther’s studies (1968) towards a reflectional theory of history.

Comparision Mersenne-Brown
A kind of a duality holds between the indicational semiotics in the sense of the George Spencer Brown’s calculus of indication and the semiotics of a possible Mersenne calculus of distinction.
The calculus of indication is topoloy-invariant, i.e. invariant under permutation, and identity-variant for atomic elements.
The Mersenne calculus is topology-variant, i.e. variant under permutation, and identity-invariant for non-atomic elements.

Indicational rules: (aa)!=ind (bb), (ab) =ind(ba); cardinality Indtypeset structure = typeset structure,
Mersenne rules:    (aa) =mers (bb), (ab) !=typeset structure(ba); cardinality Mn = 2n-1.

Indication:                   Mersenne:
J1: { }{ } = { }               M1: { }{ } = ⌀
J2: {{ }} = ⌀                  M2: {{ }} = { }.  
                      
m=n=2                          n=2
card(ind(2, 2)) = 3          card(Mers(2)) = 3
(aa), (bb); (ab).            (aa); (ab), (ba).

typeset structure

typeset structure

Completeness
Schadach proves the completeness of his classification system. There exists no other classifications of independent and mixed mappings over BA.
Therefore, Gunther’s kenogrammatic system is, in respect to kenogrammatics, complete too. There are no further independent or mixed genuine kenogrammatic classifications over BA.

On the base of this complete system of classification arbitrary new special cases and mixtures are trivially possible.

Obviously, the common condition of the Schadach’s classification is the preservation of the “length” of the mappings and the exclusion of any metamorphic properties of bisimilarity between mappings of different ”length”.

Mixed semiotics
All further distinctions like trito-, deutero- and proto-structure of commutative and partitive semiotics contain a mix of concepts of identical signs and of kenogrammatics.
Schadach’s dependency graph starts with identity (i) and ends with the cardinal equivalence (c).

Implicational orders <br />

Implicational order                ... p; )/(↘ (d) --> (e) ↗    ) (g) -->  (c)    <br />

<br /> a = trito, b = deutero, g = proto - kenogrammatics <br /> d = indicational (sign - heap ... r /> i = identity semiotics, c = cardinality, <br /> (a, d), (d, e), (b, e) = mixed systems <br />

                GRPHEMAT ... r />             Number <br />   

1.1.2.  Schadach’s system of classification

Let A and B nonempty finite sets A = {a1, a2, ..., an} and B = {b1, b2, ..., bm}
Let BA denote the set of allmappings from A to B,

BA ={μ | μ: A --> B}.

This is elaborated at: Morphogrammatik.

How to construct monomorphies mathematically?
The question: What replaces atomic signs in a kenogrammatic pattern (morphogram)? Is answered by Schadach with the introduction of monomorphies of morphograms.

From a mathematical point of view, monomorphies are partitions of mappings. This is well elaborated by [Schadach 1967]. The procedure to build monomorphies out from morphograms, as it is mathematically defined by Schadach’s approach, shall be called monomorphic decomposition.


typeset structure
typeset structure
typeset structure

(Dieter J. Schadach, BCL Report No. 4.1, August 1, 1967)

1.1.3.  Table of graphematic systems

typeset structure

Proömik und Disseminatorik in: DISSEMINATORIK. Theorie polykontexturaler Systeme,
http://www.thinkartlab.com/pkl/media/DISSEM-final.pdf

1.1.4.  System of independent characteristics

Interestingly there are two different aspects of classification, one class are independent and the other class are dependent, i.e. mixed classififications.

The idependent classifications are divided into two different types: kenogrammatic and semiotic.
One classification of the independent type is delivering the kenogrammatic classifications of trito-deutero- and proto-structure (α, β, γ).

The other classifcation of the independent type is delivering an independent semiotic specification of the 'indicational' (III, δ) and the ‘partitive' (VII, ε) classifications. Both chains start with identity (0, ι) and end in the trito-structure (IV, α).

The kenogrammatic classifications are clearly depending on the classification of the target sets of their mappings, i.e. A/Kern μ of the mapping μ A --> B, with μ ∈ BA.

The other kinds of classification are achieved by a mix of the independent criteria.
I = (α, δ), II = (δ, ϵ) and V = (δ, ε).
Until now there are no scriptural systems known with the characteristics of the mixed graphematic systems.

Obviously, the classification semiotics (0, ι ) got a highly complete elaboration.

From the kenogrammatic systems, the trito-structure (IV, α) got some elaboration. Specific studies to deutero- and proto-systems are not yet available, probably because it is believed that their structures are quiet simple compared to the trito-structure.

From the semiotic abstractions (III, δ) and (VII, ε), only (III, δ) got a extensive study in the disguise of the Calculus of Indication of Spencer Brown’s Laws of Form. But a specific graphematic study of the Laws of Form is still lacking.
It seems that the Calculus of Indication appears as a surface structure pointing to the graphematic structure of ‘commutative'  and ‘topologically’ invariant properties of graphematic systems of inscription with the crucial restriction to a 2-element alphabet.

The semiotic abstraction (VII, ε) which is connected to Mersenne numbers seems to reflect a kind of a dual symbolization to the indicational system (III, δ). This observation is not yet elaborated enough to make any reasonable comments.
http://www.rudolf-matzka.de/dharma/kenogrammatik.pdf

A general approach to Calculi of Indication for arbitrary elements had been proposed by the introduction of the quadralectic Diamond Calculi.
http://www.thinkartlab.com/pkl/media/Diamond%20Calculus/Diamond%20Calculus.html

Other formats
For people who are into theorems it is proven that Indicational semiotics and Mersenne semiotics are independent semiotics in the graphematical system of inscription. Further more it is proven that Indicational semiotics and Mersenne semiotics share a kind of duality or complementarity in the graphematic system of inscription (symbolization).

Theorem-I
Indicational Calculi are semiotically independent systems.

Theorem-II
Mersenne Calculi are semiotically independent systems.

Lemma-1
George Spencer Brown’s Calculus of Indication is a special case of Indicational Calculi.

Lemma-2
The Calculus of Indication is the smallest possible indicational calculus.

Proofs are left to the reader.

Summary
There are
1. 3 kenogrammatic systems: trito, proto and deutero.
2. 3 identitive systems: semiotics, partition (Mersenne), indication (Spencer Brown)
3. 3 mixed identical-kenomic systems: trito-partitive, trito-commutative (trito-Brown), deutero-partitive.

1.1.5.  Interdependencies and derivations

Indicational systems in the form of George Spencer Brown’s Calculus of Indication had been studied in extenso by Louis Kauffman and got a especial reception in German sociological system theory (Luhmann) but mainly under the restriction of speculative applications, avoiding any further formal elaborations.

The graphematic question is: Are there other graphematic systems like trito-kenogrammatics or identitive semiotics deducible from the indicational approach?

Indication is indicated as a independent level of inscription. But are the other independent level achievable with the means of indication, say in the sense, as indiction is achievable from the trito-structure?

Combinatorically, the question is: How can we abstract, say from the trito-formula typeset structureS(n, k)to the indicational formula typeset structure?

Descriptively, how to define [aaa] =trito[bbb] with indication which states (aaa) !=ind(bbb), but (abb) =ind (bba)?

It seems to be easy to define indication from the position of the trito-structure.
[aaa] =trito[bbb] =>cristallization {(aaa), (bbb)}SEM and (aaa)!=ind (bbb).
With [ab} =trito[ba], the indicational <ab> = <ba> holds trivially.

In respect of the cardinality of the mappings there is a direct implicational order between indication => deutero => trito.

1.2.  The Stirling Turn for morphogrammatics

1.2.1.  Abstractions, concretizations and mixtures

According to the newly introduced Stirling Turn, the dependency graph might be changed with (trito) at the top and therefore involving a different approach to the application of abstractions over trito-structures.
This kind of classification is related also to the complexity of the properties of the classification levels and not just to the cardinality of repeatable elements like it is the case for the morphism approach of a classification starting with the level of identity.

In this sense, the level of tritograms seems to be the most complex with interesting properties like retrograde recursivity and element- or object-independence. Morphograms of the trito-level are composed by monomorphies and not by atomic elements of a sign repertoire. The structure of morphograms is not limited to linear sequences of monomorphies. Monomorphies are enabling naturally to study metamorphic transformations and bisimilarity of behaviors.

The Stirling Turn takes into account the fundamental property of the memristivity of matter and its inscription in the medium of symbolization realized by the trito-structure of kenogrammatics.

Identity comes then as a ‘crystallization' (objectivation) of tritograms, while the deutero- and protograms are introduced as successive direct abstractions from the genuine trito-level. This objectivation of tritograms to identities is eliminating fundamental properties of tritogrammatic level, like retrogradness, metamophy and bisimilarity. Such properties might be reconstructed secondarily on the base of identitive semiotics but are no more of any fundamental importance.

An interesting mix of properties, identity and deutero, is introduced with the indicational level of abstraction which doesn't therefore belong to the strictly kenogrammatic system. The indicational level is independent, the same holds for the Mersenne level.
But the properties might be understood as a mix of the deutero- and the identity-level where the deutero-levels entails properties from the trito-level too.
Deutero-properties, (aab) =Deutero (aba)=Deuero (baa) and (aaa) = Deutero(bbb), hold for the indicational commutativity, i.e. (ab) =ind (ba) and (aa) !=ind(bb), and for the Mersenne-level with (aa) =MERS (bb) and (ab) !=MERS (ba).

Cardinality is an obvious further abstraction of the proto-structure of morphograms.

There is no new dogmatism involved with the Stirling Turn, which takes tritograms as an initial level for the development of all graphematic levels of inscription. With a change of focus to other prevalences other kinds of classifications might be reasonable. In contrast, the semiotic approach to classifications, which is included in the graphematic approach as a special kind, is not able to offer a dynamic approach to classificatory systems with changing standpoints or contexts of prevalences.

                &nb ... nbsp;              (card) <br />)

 Trito - system    <br />  (         &n ... sp;       (γ)         <br />

Type                                               Property
(α) = trito                               keno-retrograde recursivity, monomorphies,
(β) = deutero                           keno-partitive
(γ) = proto                              keno-commutativity, distributive, associative
(ι ) = identity                           recursivity, associative, monoid
(δ) = indicational                      indentive "topological" commutativity
(ε) = Mersenne                         identitive partitive
(c) = cardinality

1.2.2.  Graphematic CAs and equivalence classes of CCAs

According to the 10 graphematic types of inscriptions, ten fundamentally different types of cellular automata are accessible for definitions. On each inscriptional level of graphematics a specific kind of cellular automata shall be defined.

In strict contrast, a conservative interpretation of the classification based on equivalence relations is achieved with a classification of the data set of identitive cellular automata BA into equivalence classes of CAs, therefore, with the start of classical concept of CAs as mappings we get:

typeset structure

CA = (grid, data, rules)

CAtypeset structure = (grid, datatypeset structure, rules)

With trito-systemes as a beginning of the graphematic system of classification is not anymore conserned primarily with the cardinality of the classes but with the system of there operational properties. Classification or systematization becomes then a mix of abstraction and concretization (crystallisation) of kenomic patterns.

Example for trito - version m = 2, n = 3           ... p;          (baa), {aab}, {aba}  _ Mersenne)

1.3.  Category-theoretic classifications

Classifications based on different operators are delivering second-order concepts like the bisimilarity of the behavior of operational systems.

How does the distinctions of equality, equivalence, similarity and bisimilarity, introduced for different cellular automata and semi-Thue systems, fit into the classification of notation systems?

The partition, introduced by Dieter Schadach, is based on set-theoretic considerations for a complete system of partitions.
Certainly, the concept of bisimilarity is not directly covered by such an attempt to a classification of set-based mappings.

What is the difference to semiotic abstractions? The kenomic abstraction of bisimilarity happens over the operators and not over the sign sets like for semiotic systems. Equivalence classes in semiotic systems are build over sets of signs and not over the operations on signs. Hence, the kenomic abstraction of bisimilarity is a kind of a second-order abstraction.
http://www.thinkartlab.com/pkl/media/Web_Mobility/Web_Mobility.pdf

2.  Graphematics of inscriptional systems

2.1.  Morphism-based classification

2.1.1.   Equality: Semiotics (BA)

 <br />    card B ^A = m ^n <br /> <br /> where n = card A, m = card ... min {m, n} . <br /> Underoverscript[∑, k = 1, arg3] m !/(m - k) ! S (n, k)  = m ^n .

Sem(2, 3) = 2typeset structure
Alphabet = {a, b}
23: {aaa, bbb, aab, aba, abb, baa, bab, bba}.

Btypeset structure: 2typeset structure= 16:  {aaaa, aaab, aaba, aabb, abaa, abba, abab, abbb,
                    bbbb, bbba, bbab, bbaa, babb, baab, baba, baaa}.

Sem(3, 2) = 32 = 9
Alpabet= {a, b, c}
{aa, bb, cc, ab, ac, ba, bc, ca, cb}

2.1.2.  Keno-Equivalence: Trito (IV)

   <br />     card(Trito(m, n)) = Underoverscript[∑, k = 1, arg ... sp;         aabc, abac, abbc, abca, abcb, abcc ; abcd } .

<br />    trito - kenomic structure <br />         ...     <br /> [aaa]      [aab]   [aba][abb][abc]  <br />

Partitions with localization and repetitions.

2.1.3.  Keno-Equivalence: Deutero (VI)

<br />       Underoverscript[ card(Deutero(m, n)) = Underoverscript[& ... erscript[∑, k = 1, arg3] P(4, k) : 1    + 2 = 3. VI .   =   {aaaa, aaaab, aabb} .

Sloane’s  A000041  a(n) = number of partitions of n (the partition numbers).
1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490, 627, 792, 1002, 1255, 1575, 1958, 2436, 3010, 3718, 4565, 5604, 6842, 8349, 10143, 12310, 14883, 17977, 21637, 26015, 31185, 37338, 44583, 53174, 63261, 75175, 89134

The subject of partitioning integers is very rich and quite deep.
http://www.artofproblemsolving.com/Resources/Papers/LaurendiPartitions.pdf

Programming aspects of partitions.
http://programmingpraxis.com/2011/04/15/partition-numbers/

2.1.4.  Keno-Equivalence: Proto (VIII, γ)

typeset structure

VIII. = {aaaa, aaab}.

2.1.5.  Indicational (III, δ)

<br />       card(Ind(m, n)) = ((n + m - 1)/n)    &nbs ... = card B, M = min {card A, card B} Pascal   (Yang Hui ) combinations (m/n) = m !/(n ! (m - n ) !)

Examples

m = n = 2 :    ((2 + 2 - 1)/2) = (3/2) = 3 Alpabet = {a, b} Ind (2, 2) = {aa, ab, bb ... abc} . <br /> <br /> m = 2, n = 4 card(Ind(2, 4)) = 5 III . =   {aaaa, bbbb ; aaab, abbb ; aabb }

               &nbs ... sp; b       <br />          

2.1.6.  Partitive identitive semiotics : typeset structure

A Mersenne number, not with primes, is a number of the form :    <br /> <br />   ... #xF3A0; _ n = 2 ^n - 1 <br /> <br /> 1, 3, 7, 15, 31, 63, 127, 255, (Sloane ' s A000225),

http://mathworld.wolfram.com/MersenneNumber.html

Mersenne numbers.

2 ^2 - 1 = 3 :       {aa, ab, ba} ,    (eq : aaaa,  ... , aaab} . <br /> <br /> (aa) =   _ MERS (bb), (ab) !=  _ MERS (ba) <br />

               &nbs ...      a         b      <br />

2.1.7.  Trito-partitive semiotics (II, α, ε)

<br /> <br />     card B ^A  _ (/ _ II) = Under ... , k) (m/k)     <br /> <br /> where n = card A, m = card B, M = min {card A, card B}

<br /> Example : m = n = 4 <br /> IV .   = Underoverscript[∑, k = 1, arg3]  S (m, k) (m/ ...     <br /> <br /> II .   = {aaaa, bbbb ; aaab, aaba, abaa, baaa ; aabb, abab, abba}

2.1.8.  Trito-commutative semiotics: typeset structure (α, δ)

   <br />    card (TCS (m, n)) = Underoverscript[∑, k = 1, arg3] S (n, k) ((n + m - 1)/n) <br />

<br /> Because of the number series involved , trito - commutative semiotics might be called t ... <br /> I .   = {aaaa, bbbb ; aaab, aaba, abaa, baaa ; abbb, babb, bbab, bbba ; aabb, abab, abba} .

2.1.9.  Deutero-partitive semiotics (V, β,ε)

    <br />     card B ^A  _ (/ _ V) = Underovers ... , arg3]  P (m, n) (m/n)    <br /> whre n = card A, m = card B, M = min {card A, card B}

Example : m = 2, n = 4 <br /> Underoverscript[∑, k = 1, arg3]  P (m, n)    : < ... pt[∑, k = 1, arg3]  P (m, n) (m/n) : 3 + 1 = 4 <br /> V .   =   {aaaa, bbbb ; aaab, aabb} .

More combinatorial elaborations and results at: Morphogrammatik.
http://works.bepress.com/thinkartlab/15/

2.2.  Interaction-based classification

2.2.1.  Intracontextural bisimilarity

Intracontextural bisimilarity is based on the abstraction over operators on kenogrammatic systems. Depending on the kenogrammatic systems and the set of involved kenogrammatic operators different kind of classifications are to be build. Such bisimilar classifications are not yet involved in cross-contextural constructions and remain inside the realm of contextures of established complexity.

2.2.2.  Transcontextural bisimilarity

Transcontextural bisimilarity of classifications is involved into the process of metamorphosis between contextures and their intra-contextural classifications of different kinds.

3.  Graphematics of 1 D cellular automata

3.1.  Graphematic system of cellular automata types

3.1.1.  Tritogrammatic CAs

Tritogrammatic CAs are identical to the kenoCAs introduced in previous papers.

typeset structure
typeset structure

http://memristors.memristics.com/CA-Compositions/Memristive%20Cellular%20Automata%20Compositions.pdf

3.1.2.  Deuterogrammatic CAs

Deuterogrammatic CAs are identical to the deutero-kenoCAs introduced in previous papers.

Deutero - rules for kenoCA ^(4, 2) (R1 •   •   • , R2 •   R ...          x                           •                     •                     stop

3.1.3.  Protogrammatic CAs

Protogrammatic CAs are identical to the proto-kenoCAs introduced in previous papers.

3.1.4.  Indicational CAs

Indicational CAs are identical to the indCAs introduced in previous papers.

Enactional rule set for indicational cellular automata indCA <br />  R1 •   •   &# ...  O         -          -   O   -             -         •   -            -         •   -

<br /> Example <br /> indCA, r = {5, 6, 3, 8} <br /> Nr . l                      1             ...           x                           x                           x                           stop

3.1.5.  MersenneCAs

2 ^3 - 1 = 7   :        {aaa, aab, aba, abb, bba, bab, baa}, with  ... 3A0; _ eta (bbb) . <br /> MersenneCA ^(3, 2) = (2 ^3 - 1) x P (2, 2) = 7 x 2 = 14.

Rules   for   etaCA ^(3, 2) •   •   • •   •   O       &# ...        -         O         -                    -         O         -       -         O         -

The etaCA ^(3, 2) rules are representing 2 ^3 - 1 basic rules . Thus the CCA & ... e are two CCA ^(3, 2) rule sets represented by the etaCA ^(3, 2) basic rule sets .

Example  Nr . l                                                                                ...                                                                                              MERS

3.1.6.   Trito-commutative CAs

Trito - commutative CAs are a mix of trito - and commutative structures .

Further informations about memristive cellular automata:
http://memristors.memristics.com/Morphic%20CA/Sketch%20of%20Memristic%20Cellular%20Automata.pdf

3.2.  How many mappings are in each equivalence class?

Semiotic cellular automata, ECA or CCA, are produced or introduced in this context as crystallizations of tritogrammatic CAs (kenoCAs).

A tritogram has a number of crystalizations depending on its context, i.e. complexity and complication.

For example, in the context of m=2, n=3, the tritogram [aaa] has just two crystallisations on the semiotic level: (aaa), (bbb), e.g. for the semiotic identity and for the indicational level.

Hence, a general formula is necessary to determinate the number of crystallizations of tritograms into identities.
With the formulas for the number of trito-, deutero- and proto-abstractions “we know how many proto-, deutero, and trito-equivalence classes there are in the set BA of mappings between finite sets A and B.
But how many mappings are in each equivalence class?”
(Schadach, p.107, BCL-Report No. 2.2, 1967)

The answers to this question is given by exact formulas which decide how many identitive constellations are restored in the transition from the trito-, deutero- and proto-levels. In other words, how many crystallisations of identive patterns are represented by the graphematic levels of trito-, deutero- and proto-structures. These questions had been answered with two papers by Dieter Schadach (Febr.1967, Aug.1967).
D. J. Schadach, Biomathematik I u. II. (WTB, Bd. 83 u. 87), Berlin/Oxford/Braunschweig 1971. Akademie-Verlag/Pergamon Press/Vieweg + Sohn
http://www.ballonoffconsulting.com/PDF/1987AppendixII.pdf

Trito - level  Cell[GraphicsData[PICT, RTX000000;<1o@0A0_l<0?on0000B00004P000000000/`7m0 ... ze -> {478.5, 168.25}, ImageMargins -> {{0., 0.}, {0., 0.}}, ImageRegion -> {{0., 1.}, {0., 1.}}]

The number of mappings in the trito - class is given by card [μ]  _ t : <br /> <br />    card [μ]  _ t = m !/(m - k) ! <br />

<br /> Example <br /> m = k = 3, 3 !/(3 - 3) ! = 3 ! = 6 <br /> [abc]  _ trito => { (abc), (acb), (bca), (bac), (cba), (cab)}  _ ident .

Hence, the tritogram  [abc] has 6 identitive representations because all semiotic permutations of the tritogram [abc] are kenogrammatically equivalent.

For m = 3, k = 2 there are 6 equivalent representation of the tritogram [abb] : <br /> 3 !/(3  ...  ! = 6 [abb]  _ trito => {(abb), (acc), (baa), (bcc), (caa), (cbb)}  _ ident .

<br /> Schadach ' s example for trito - class card [μ]  _ trito <br /> Underoverscript[∑, k = 1, arg3] m !/(m - k) ! , n = 6, m = 5, M = min {n, m} = 5, k = 1, 2, ..., 5.

<br /> m = 5, k = 1, 5 !/(5 - 1) ! =    5 !/4 ! = 5 <br /> m = 5, k = 2, 5 !/(5 - 2) ... sp; 5 !/0 ! = 120 <br /> Hence, <br /> Underoverscript[∑, k = 1, arg3] 5 !/(5 - k) !  = 325.

<br /> Application <br /> m = 9, k = 4, 9 !/(9 - 4) ! =    9 !/5 ! = 3024 <br /> [abbaabccd]  _ trito    = {(abbaabccd), ..., (dccddcbba)}  _ ident

A trito key [abbabccd] in a security system represents 3024 different semiotic keys for the trito-key out of the 94= 6561 possible different identitive semiotic keys.
http://www.thinkartlab.com/pkl/media/Web_Mobility/Web_Mobility.pdf

Deutero-level

[Graphics:HTMLFiles/Graphematic System of Cellular Automata_65.gif]

The number of mappings in the deutero-class is given by card [μ]d:

   <br />    card[μ]  _ d = n !/((1 !) ^(e  _ ...  _ n)) (m/k) k !/(e  _ 1  ! e  _ 2 !  ... e  _ n !) <br />

<br /> Proto - level <br /> The number of mappings in the proto - class is given by card [_ ... F3A0; _ i1  ! e  _ i2 !  ... e  _ in !)     <br />


[Graphics:HTMLFiles/Graphematic System of Cellular Automata_68.gif]

3.2.1.  Semiotic cellular automata representations

Semiotic cellular automata are the common type of CAs, based on the identity principle of the use of their signs and methods.

The question is: How are semiotic CAs represented by kenogrammatic CAs of the trito-structure?

The answer is given by the combinatorial considerations regarding the translation or mapping of trito-structures into identity structures.

This translation is fairly trivial if classical 1 D CAs are considered. For their binary complexity with m=2 and complication n with n=3, the rule range is 28=256.

Hence the trito-structure tritoCAtypeset structure has a set of the single local elementary rules of
Stirling2(2, 3) x P(2, 2): 4 x 2typeset structure, with a rule space of typeset structure.

Rules for tritoCAtypeset structure
typeset structure


Semiotic rulesCAtypeset structure
typeset structure

<br /> m = k = 3 <br /> <br /> [abb]  _ trito => {(abb), (acc), (baa), (bcc), (caa) ... •   -        -         •   -        -         •   -        -         •   -

This is work in progress and needs much more mathematical elaboration. It is, again, a hint in the right direction - not more but not less.