Journal ArticleDOI
Some results on time-varying and relativised cellular automata
Meena Mahajan,Kamala Krithivasan +1 more
Reads0
Chats0
TLDR
In this paper, the recognition capabilities of CA and TVCA are compared, and the power of this implicit query mechanism is compared with the traditional oracle access in Turing machines.Abstract:
Cellular automata (CA) are parallel language recognition devices. In this paper, the notion of a time-varying CA (TVCA) is introduced. In a TVCA, the transition function can vary with time, and the variation is controlled by a prespecified language. This language can be viewed as an oracle to which the TVCA makes implicit queries; thus TVCA provide a mechanism for defining relativised CA. In this paper, the recognition capabilities of CA and TVCA are compared. TVCA as relativised CA are formalised, and the power of this implicit query mechanism is compared with the traditional oracle access in Turing machines.read more
Citations
More filters
Journal ArticleDOI
Simulation of cellular automata
TL;DR: A survey of the features of several software packages for the simulation of CA is given and a domain decomposition approach and possible optimizations are described.
Book ChapterDOI
Programming Environments for Cellular Automata
TL;DR: Some modifications and generalizations of cellular automata are discussed which are sometimes useful in the modeling of real phenomena and which therefore have found their ways into some programming environment for cellular Automata.
Journal ArticleDOI
Nondeterministic, probabilistic and alternating computations on cellular array models
Kamala Krithivasan,Meena Mahajan +1 more
TL;DR: It is shown that this form of nondeterminism corresponds to the traditional notion in the unbounded-time case, but there appear to be differences when real-time or linear-time cellular automata are considered.
Journal ArticleDOI
Non-deterministic cellular automata and languages
TL;DR: Speed-up results and the possibility to reduce the non-determinism as well as closure properties of languages acceptable with a constant number ofnon-deterministic transitions are presented.
Book ChapterDOI
Relativised Cellular Automata and Complexity Classes
Meena Mahajan,Kamala Krithivasan +1 more
TL;DR: Some of the fundamental problems concerning cellular automata (CA) are as follows: Are linear-time CA (lCA) more powerful than real-timeCA (rCA)?
References
More filters
Journal ArticleDOI
Some results concerning linear iterative (systolic) arrays
TL;DR: It is shown that in many cases arrays with global control can be simulated in real-time by arrays without global control, and a speed-up theorem is proved that is stronger than what has previously appeared in the literature.
Journal ArticleDOI
Relating the power of cellular arrays to their closure properties
H. Ibarra Oscar,Tao Jiang +1 more
TL;DR: The relationships among these problems as well as prove some positive results concerning CA's are investigated, and it is shown that the languageL={0n1m|m,n>0, mdividesn}is a real-time CA language, disproving a conjecture of Bucher and Culik.
Journal ArticleDOI
On the power of one-way communication
TL;DR: Results are given which show that 1LIA's are surprisingly very powerful in that they can accept languages which seemingly require two-way communication.
Journal ArticleDOI
On real time and linear time cellular automata
Walter Bucher,Karel Culik +1 more
TL;DR: On considere les classes de langage acceptes par des automates cellulaires «1 voie» and «2 voie’ sous diverses restrictions de temps s’agissant en temps reel sont equivalents aux automate cellulaires travaillant en Temps reel.
Journal ArticleDOI
On Some Open Problems in the Theory of Cellular Automata
TL;DR: Some open problems in the theory of cellular automata are considered: the tradeoff between machine complexity and interconnection complexity, linear time pattern recognition and transformation problems, and the noncomputability of the constant of linearity of linear time problems.
Related Papers (5)
Growing context-sensitive languages and Church-Rosser languages
Gerhard Buntrock,Friedrich Otto +1 more