Constructible functions in cellular automata and their applications to hierarchy results
Theoretical Computer Science
On interacting automata with limited nondeterminism
Fundamenta Informaticae - Special issue on cellular automata
Fundamenta Informaticae - Special issue on cellular automata
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
Iterative Arrays with Small Time Bounds
MFCS '00 Proceedings of the 25th 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
On Time-Constructible Functions in One-Dimensional Cellular Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Iterative Arrays with a Wee Bit Alternation
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
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
Theoretical Computer Science
Space- and time-bounded nondeterminism for cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Real-time generation of primes by a 1-bit-communication cellular automaton
Fundamenta Informaticae - Special issue on cellular automata
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
Information and Computation
Theory of cellular automata: a survey
Theoretical Computer Science
Closure properties of cellular automata
Theoretical Computer Science
Low complexity classes of multidimensional cellular automata
Theoretical Computer Science
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
Information and Computation
Languages not recognizable in real time by one-dimensional cellular automata
Journal of Computer and System Sciences
Information and Computation
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Automaton representation of linear conjunctive languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
A simple P-complete problem and its language-theoretic representations
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
Comparing linear conjunctive languages to subfamilies of the context-free languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Sequence generation problem on communication-restricted cellular automata
NOLASC'06 Proceedings of the 5th WSEAS international conference on Non-linear analysis, non-linear systems and chaos
Cellular automata with limited inter-cell bandwidth
Theoretical Computer Science
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
Space- and Time-Bounded Nondeterminism for Cellular Automata
Fundamenta Informaticae - Cellular Automata
Real-Time Generation of Primes by a 1-Bit-Communication Cellular Automaton
Fundamenta Informaticae - Cellular Automata
On Interacting Automata with Limited Nondeterminism
Fundamenta Informaticae - Cellular Automata
Fundamenta Informaticae - Cellular Automata
Expressive power of LL(k) Boolean grammars
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Hi-index | 5.24 |