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
Dissertation
Cellular Automata-based Algorithm for Liquid Diffusion Phenomenon Modeling using imaging technique
TL;DR: The result obtained from the proposed LDP model compared to other competitive LDP models has higher accuracy and less computation time, and the results showed that there is a direct relationship between the temperature and the diffusion speed.
Journal ArticleDOI
Language classes defined by time-bounded relativised cellular automata
Meena Mahajan,Kamala Krithivasan +1 more
TL;DR: This paper constructs oracle classes under which the CA classes coincide, and builds a hierarchy of relativised CA complexity classes between rCA and CA, and study the dependencies between the classes in this hierarchy.
References
More filters
Journal ArticleDOI
Real-time language recognition by one-dimensional cellular automata
TL;DR: Pattern recognition by parallel devices is investigated by studying the formal language recognition capabilities of one-dimensional cellular automata, finding that nondeterministic bounded cellular Automata can recognize the context-free languages in real time.
Journal ArticleDOI
On real-time cellular automata and trellis automata
Christian Choffrut,Karel Culik +1 more
TL;DR: It is shown that f(n)-time one-way cellular automata are equivalent to f( n)-time trellis automata, the real-timeOne-way Cellular automata languages are closed under reversal, the 2n- time one- way cellular Automata are equivalents to real- time cellular automATA and the latter are strictly more powerful than the real -time one -way cellularAutomata.
Journal ArticleDOI
One-way bounded cellular automata
TL;DR: Real-time acceptors are presented for many of the languages that have been shown to be accepted by conventional two-way acceptors, including several classes of context-free languages.
Journal ArticleDOI
Cellular automata complexity trade-offs*
TL;DR: It is demonstrated that any linear time cost can be eliminated and, in fact, a speed-up by arbitrary positive integer factor k can be attained at an increased structural cost.
Related Papers (5)
Growing context-sensitive languages and Church-Rosser languages
Gerhard Buntrock,Friedrich Otto +1 more