Nondeterministic, probabilistic and alternating computations on cellular array models
Kamala Krithivasan,Meena Mahajan +1 more
Reads0
Chats0
TLDR
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.About:
This article is published in Theoretical Computer Science.The article was published on 1995-05-29 and is currently open access. It has received 11 citations till now. The article focuses on the topics: Unbounded nondeterminism & Cellular automaton.read more
Citations
More filters
Book
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics
TL;DR: Breaking and fixing the Needham-Schroeder public-key protocol using FDR, and fully consistent extensions of partially defined Boolean functions with missing bits.
Cellular Automata and Language Theory.
TL;DR: This chapter discusses iterative arrays, which are iterative automata whose leftmost cell is distinguished, and cellular automata, a linear array of cells which are connected to both of their nearest neighbors and whose input data is determined by the input data.
Journal Article
Cellular Devices and Unary Languages
Andreas Klein,Martin Kutrib +1 more
TL;DR: It is proved that there exists a unary complexity class in between the real-time and linear-time OCA languages, and that there is a gap between the unary real- time OCA Languages and that class.
Journal ArticleDOI
Alternation on cellular automata
TL;DR: It is proved that real time alternation in cellular automata is strictly more powerful than real timeAlternation in Turing machines, with only one read-write tape, and it is shown that in linear time uniform and weak models agree.
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.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
Structural Complexity I
TL;DR: This volume is written for undergraduate students who have taken a first course in Formal Language Theory and presents the basic concepts of structural complexity, thus providing the background necessary for the understanding of complexity theory.
Book
Structural Complexity II
TL;DR: This is the second volume of a systematic two-volume presentation of the various areas of research in the field of structural complexity, addressed to graduate students and researchers and assumes knowledge of the topics treated in the first volume but is otherwise nearly self-contained.
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.