On the power of one-way communication
Journal of the ACM (JACM)
A brief history of cellular automata
ACM Computing Surveys (CSUR)
Constructible functions in cellular automata and their applications to hierarchy results
Theoretical Computer Science
Massively parallel fault tolerant computations on syntactical patterns
Future Generation Computer Systems - Cellular automata CA 2000 and ACRI 2000
On interacting automata with limited nondeterminism
Fundamenta Informaticae - Special issue on cellular automata
A geometrical hierarchy on graphs via cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Collision-based computing
Real-Time Language Recognition by One-Way and Two-Way Cellular Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A Time Hierarchy for Bounded One-Way Cellular Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Signals for Cellular Automata in Dimension 2 or Higher
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Real-Time Language Recognition by Alternating Cellular Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On Time-Constructible Functions in One-Dimensional Cellular Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Speeding-Up Cellular Automata by Alternations
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Fast one-way cellular automata
Theoretical Computer Science - Mathematical foundations of computer science
Descriptional complexity of cellular automata and decidability questions
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
The hardest linear conjunctive language
Information Processing Letters
Two-dimensional cellular automata and deterministic on-line tessalation automata
Theoretical Computer Science
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
Theoretical Computer Science
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
Information and Computation
Theory of cellular automata: a survey
Theoretical Computer Science
State complexity of linear conjunctive languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Closure properties of cellular automata
Theoretical Computer Science
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Low complexity classes of multidimensional cellular automata
Theoretical Computer Science
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
Languages not recognizable in real time by one-dimensional cellular automata
Journal of Computer and System Sciences
Homomorphisms preserving linear conjunctive languages
Journal of Automata, Languages and Combinatorics
Information and Computation
Automaton representation of linear conjunctive languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Cellular automata with sparse communication
Theoretical Computer Science
Incremental learning of cellular automata for parallel recognition of formal languages
DS'10 Proceedings of the 13th international conference on Discovery science
Achieving universal computations on one-dimensional cellular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Bulking I: An abstract theory of bulking
Theoretical Computer Science
Cellular automata: real-time equivalence between one-dimensional neighborhoods
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Grids and universal computations on one-dimensional cellular automata
Natural Computing: an international journal
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
On Interacting Automata with Limited Nondeterminism
Fundamenta Informaticae - Cellular Automata
A Geometrical Hierarchy on Graphs via Cellular Automata
Fundamenta Informaticae - Cellular Automata
Synchronization of a Line of Identical Processors at a Given Time
Fundamenta Informaticae
A padding technique on cellular automata to transfer inclusions of complexity classes
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.01 |