On two-way communication in cellular automata with a fixed number of cells

The effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on their size of description is studied, kC-OCAs are a parallel model for the regular languages that consists of an array of k identical deterministic finite automata (DFAs), called cells, operating in parallel. Each cell gets information from its right neighbor only. In this paper, two models with different amounts of two-way communication are investigated. Both models always achieve quadratic savings when compared to DFAs. When compared to a one-way cellular model, the result is that minimum two-way communication can achieve at most quadratic savings whereas maximum two-way communication may provide savings bounded by a polynomial of degree k.

[1]  Rainer Kemp,et al.  A One-to-One Correspondence between two Classes of Ordered Trees , 1989, Inf. Process. Lett..

[2]  Andreas Malcher.  Descriptional Complexity of Cellular Automata and Decidability Questions , 2001, DCFS.

[3]  Martin Kappes,et al.  Combining Contextual Grammars and Tree Adjoining Grammars , 2000, Grammars.

[4]  Rolf Drechsler,et al.  Testability of circuits derived from functional decision diagrams , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.

[5]  Andreas Malcher.  On One-Way Cellular Automata with a Fixed Number of Cells , 2003, Fundam. Informaticae.

[6]  Jens Liebehenschel.  Lexicographical Generation of a Generalized Dyck Language , 2003, SIAM J. Comput..

[7]  Andreas Malcher,et al.  Descriptional Complexity of Machines with Limited Resources , 2002, J. Univers. Comput. Sci..

[8]  Rainer Kemp.  A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees , 1999, Inf. Process. Lett..

[9]  Rainer Kemp.  On Leftist Simply Generated Trees , 1999, J. Autom. Lang. Comb..

[10]  Martin Kappes,et al.  Multi-Bracketed Contextual Rewriting Grammars , 1999, Fundam. Informaticae.

[11]  Johann Wolfgang.  The Principal Independent Components of Images , 1998 .

[12]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[13]  Minimization of 2-level AND / XOR Expressionsusing Ordered Kronecker Functional Decision Diagrams , 2007 .

[14]  Rolf Drechsler,et al.  A genetic algorithm for variable ordering of obdds , 1996 .

[15]  Martin Kappes.  Descriptional Complexity of Deterministic Finite Automata with Multiple Initial States , 2000, J. Autom. Lang. Comb..

[16]  Fabrizio Ferrandina,et al.  Implementing Lazy Database Updates for an Object Database System , 1994, VLDB.

[17]  Martin Kutrib.  Automata arrays and context-free languages , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[18]  Bernd Becker,et al.  How many Decomposition Types do we need , 1995 .

[19]  Klaus Waldschmidt,et al.  Spezifikation hybrider Systeme , 1998, MBMV.

[20]  R. Drechsler,et al.  On variable ordering and decomposition type choice in OKFDDs , 1995, Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair.

[21]  Jonathan Goldstine,et al.  On the Relation between Ambiguity and Nondeterminism in Finite Automata , 1992, Inf. Comput..

[22]  Helmut Seidl,et al.  On finitely generated monoids of matrices with entries in N , 1991, RAIRO Theor. Informatics Appl..

[23]  Jens Liebehenschel,et al.  Ranking and Unranking of Lexicographically Ordered Words: An Average-Case Analysis , 1998, J. Autom. Lang. Comb..

[24]  Markus E. Nebel,et al.  Combinatorial Properties of RNA Secondary Structures , 2003, J. Comput. Biol..

[25]  Rolf Drechsler,et al.  Synthesis for testability: circuits derived from ordered Kronecker functional decision diagrams , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[27]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[28]  Uwe Trier.  Additive Weights of a Special Class of Nonuniformly Distributed Backtrack Trees , 1992, Inf. Process. Lett..

[29]  Andreas Weber,et al.  A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem , 1988, MFCS.

[30]  Jens Liebehenschel,et al.  Ranking and unranking of a generalized Dyck language and the application to the generation of random trees. , 1999 .

[31]  Markus E. Nebel.  On the Average Complexity of the Membership Problem for a Generalized Dyck Language , 1997, FCT.

[32]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[33]  E. F. Codd,et al.  Cellular automata , 1968 .

[34]  E. Mayr.  Basic Parallel Algorithms in Graph Theory , 1990 .

[35]  Rolf Drechsler,et al.  Dynamic minimization of OKFDDs , 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.

[36]  Markus E Nebel,et al.  Investigation of the Bernoulli model for RNA secondary structures , 2004, Bulletin of mathematical biology.

[37]  C. Greg Plaxton,et al.  Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube , 1989, J. Parallel Distributed Comput..

[38]  Andreas Malcher,et al.  Minimizing finite automata is computationally hard , 2004, Theor. Comput. Sci..

[39]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[40]  Rainer Kemp.  Binary Search Trees for d-dimensional Keys , 1989, J. Inf. Process. Cybern..

[41]  Stefania Bandini,et al.  Cellular automata: From a theoretical parallel computational model to its application to complex systems , 2001, Parallel Comput..

[42]  Markus E. Nebel.  A unified approach to the analysis of Horton-Strahler parameters of binary tree structures , 2002, Random Struct. Algorithms.