2,109 Hits in 5.1 sec

Page 4080 of Mathematical Reviews Vol. , Issue 2004e [page]

2004 Mathematical Reviews  
The best known technique for proving lower bounds on the size of min- imal nondeterministic finite automata is based on communication and this technique covers all previously used approaches.  ...  Unfor- tunately, there exist regular languages with an exponential gap between the communication complexity lower bound and the size of a minimal nondeterministic finite automaton.  ... 

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

Andreas Malcher
2005 Theoretical Computer Science  
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  ...  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  ...  On the other hand, the conversion of DFAs to cellular automata may provide no savings in case of one-way communication, but always provides quadratic savings in case of two-way communication.  ... 
doi:10.1016/j.tcs.2004.04.014 fatcat:yq66lpojozhvnfr75ixslnrnly


Jarkko Kari
2017 Natural Computing  
The second paper, by Martin Kutrib, Andreas Malcher and Matthias Wendlandt, is titled Shrinking One-Way Cellular Automata.  ...  In their model, multiple finiteautomata move on a colored grid, called a configuration, and communicate with each other only over bounded distances.  ... 
doi:10.1007/s11047-017-9615-4 fatcat:32c2ksyhtjcn7pcnsc25aptpaa

On One-way One-bit O (One)-message Cellular Automata

Martin Kutrib, Andreas Malcher
2009 Electronical Notes in Theoretical Computer Science  
Here, we investigate one of the weakest class of cellular automata, namely the class of real-time one-way cellular automata. Additionally, we impose two restrictions on the inter-cell communication.  ...  Finally, decidability problems of these restricted cellular automata are studied and undecidability of almost all problems can be proven even in the most restricted case of one-way one-bit communication  ...  accepted by real-time one-way cellular automata with a constant number of communications and one-bit communication.  ... 
doi:10.1016/j.entcs.2009.09.015 fatcat:7setnb7r4vhpnf2y63vysgv77y

Page 4764 of Mathematical Reviews Vol. , Issue 94h [page]

1994 Mathematical Reviews  
We present some normal forms for minimal NFAs over a unary alphabet and present an application to lower bounds on the size complexity of an NFA.  ...  (3) Does one-way communication reduce the power of a CA? “These questions have been open for a long time. In this paper, we address these questions with respect to tally languages in rela-  ... 

Computation theory of cellular automata

Stephen Wolfram
1984 Communications in Mathematical Physics  
The limit sets generated by some classes of cellular automata correspond to regular languages. For other classes of cellular automata they appear to correspond to more complicated languages.  ...  Self-organizing behaviour in cellular automata is discussed as a computational process. Formal language theory is used to extend dynamical systems theory descriptions of cellular automata.  ...  Franks, and many of the other participants for their comments. Some of the results given above were obtained using the computer mathematics system SMP [50] .  ... 
doi:10.1007/bf01217347 fatcat:yrtu66o6xjbkbivnnm3mh2xsqy

Page 4656 of Mathematical Reviews Vol. , Issue 89H [page]

1989 Mathematical Reviews  
(4) Does one-way communication reduce the computing power of a CA?  ...  to one-way data communication (i.e., one-way CAs), then nonlinear-time CAs are more powerful than linear-time CAs; (c) if the class of real-time CA languages is closed under reversal, then it is also  ... 

Complexity of multi-head finite automata: Origins and directions

Markus Holzer, Martin Kutrib, Andreas Malcher
2011 Theoretical Computer Science  
one-way nondeterministic finite automaton, then 2 n states are sufficient, and necessary in the worst case for a one-way deterministic finite automaton to accept the same language [39, 41, 49] .  ...  ., are decidable for one-and two-way finite automata, regardless of whether they work deterministically or nondeterministically.  ...  The well-known proof of the equivalence of two-way and one-way finite automata via crossing sequences reveals a bound of O(2 2n log n ) states [19] .  ... 
doi:10.1016/j.tcs.2010.08.024 fatcat:yjkjor7r5rawrjijnxihcdnuve

Language not recognizable in real time by one-way cellular automata

Véronique Terrier
1996 Theoretical Computer Science  
We define a relation of equivalence on input words of one-way cellular automata.  ...  Then by counting arguments we show that the language {uuu: u, u E (0, l} *, 1 u 1 > 1) is not recognizable in real time on an OCA. 0304-3975/96/$15.00 0 1996-Elsevier Science B.V.  ...  Introduction In the field of massively parallel computation, cellular automata (CA) and the restricted versions -iterative arrays (IA) with sequential input mode, and one-way cellular automata (OCA) with  ... 
doi:10.1016/0304-3975(95)00111-5 fatcat:3tayuotgzfdp3jxqgmtmot3mxi

Page 2061 of Mathematical Reviews Vol. 57, Issue 5 [page]

1979 Mathematical Reviews  
Bounds on the number of states and on decision procedures for quasi-initialised finite automata are studied.  ...  He gives an algo- rithm for constructing the minimal automaton equivalent to a given automaton and also gives an upper bound of a length of the experiment which determines equivalence of given automata  ... 

Page 6653 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
Summary: “We first derive two normal-form constructions for cel- lular automata to transform any given (one-dimensional) cellular automaton into one which is one-way and/or totalistic.  ...  Melikhov (Taganrog) 90k:68122 68Q80 Albert, Jiirgen (D-WRZB); Culik, Karel, II (3-WTRL-C) A simple universal cellular automaton and its one-way and totalistic version.  ... 

Page 6036 of Mathematical Reviews Vol. , Issue 88k [page]

1988 Mathematical Reviews  
Summary: “There are two simple models of parallel language rec- ognizers: a one-way cellular array (OCA) and a one-way iterative array (OIA).  ...  Jan Chvalina (CS-PRKN) 88k:68067 68Q80 68Q05 Ibarra, Oscar H. (1-MN-C); Jiang, Tao (1-MN-C) On the computing power of one-way cellular arrays.  ... 

Page 7286 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
Summary: “We introduce a special new class of cellular automata (CA) whose inter-cell communication is restricted to 1-bit.  ...  (English summary) Special issue on cellular automata. Fund. Inform. 52 (2002), no. 1-3, 257-275.  ... 

Foundations of Reversible Computation [chapter]

Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Łukasz Mikulski, Rajagopal Nagarajan, Iain Phillips, G. Michele Pinna (+3 others)
2020 Lecture Notes in Computer Science  
Similar investigations for real-time one-way cellular automata have been done in [108] .  ...  On the other hand, the model is less powerful than real-time reversible two-way cellular automata.  ... 
doi:10.1007/978-3-030-47361-7_1 fatcat:3qgnwqrqnvdltkqjbuzfgx7wty

Page 6516 of Mathematical Reviews Vol. , Issue 98J [page]

1998 Mathematical Reviews  
These cellular automata have Hamming distance | to a permutation automaton. Moreover, the corresponding minimal Fischer automata as well as the minimal DFAs have maximal complexity.  ...  Summary: “We study the sizes of minimal finite state machines as- sociated with linear cellular automata.  ... 
« Previous Showing results 1 — 15 out of 2,109 results