On real time and linear time cellular automata
RAIRO. Inform. théor., 18 4 (1984) 307-325
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
52 109 (2025)
https://doi.org/10.1007/978-3-031-78757-7_5
On hardest languages for one-dimensional cellular automata
Mikhail Mrykhin and Alexander OkhotinInformation and Computation 295 104891 (2023)
https://doi.org/10.1016/j.ic.2022.104891
Iterative arrays with self-verifying communication cell
Martin KutribNatural Computing 21 (1) 39 (2022)
https://doi.org/10.1007/s11047-020-09812-4
Language and Automata Theory and Applications
Mikhail Mrykhin and Alexander OkhotinLecture Notes in Computer Science, Language and Automata Theory and Applications 12638 118 (2021)
https://doi.org/10.1007/978-3-030-68195-1_10
12286 59 (2020)
https://doi.org/10.1007/978-3-030-61588-8_5
Developments in Language Theory
Martin Kutrib and Thomas WorschLecture Notes in Computer Science, Developments in Language Theory 11088 340 (2018)
https://doi.org/10.1007/978-3-319-99813-8_31
Computational Complexity
Martin KutribComputational Complexity 359 (2012)
https://doi.org/10.1007/978-1-4614-1800-9_25
Non-deterministic cellular automata and languages
Martin KutribInternational Journal of General Systems 41 (6) 555 (2012)
https://doi.org/10.1080/03081079.2012.695896
Handbook of Natural Computing
Véronique TerrierHandbook of Natural Computing 123 (2012)
https://doi.org/10.1007/978-3-540-92910-9_4
Cellular Automata
Martin KutribCellular Automata 513 (2009)
https://doi.org/10.1007/978-1-4939-8700-9_54
800 (2009)
https://doi.org/10.1007/978-0-387-30440-3_54
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
Jia Lee, Katsunobu Imai and Kenichi MoritaTheoretical Computer Science 304 (1-3) 185 (2003)
https://doi.org/10.1016/S0304-3975(03)00083-5
Massively parallel fault tolerant computations on syntactical patterns
Martin Kutrib and Jan-Thomas LöweFuture Generation Computer Systems 18 (7) 905 (2002)
https://doi.org/10.1016/S0167-739X(02)00070-5
SOFSEM 2000: Theory and Practice of Informatics
Martin Kutrib and Jan-Thomas LöweLecture Notes in Computer Science, SOFSEM 2000: Theory and Practice of Informatics 1963 392 (2000)
https://doi.org/10.1007/3-540-44411-4_28
Pushdown cellular automata
Martin KutribTheoretical Computer Science 215 (1-2) 239 (1999)
https://doi.org/10.1016/S0304-3975(97)00187-4
Mathematical Foundations of Computer Science 1999
Katsuhiko NakamuraLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1999 1672 220 (1999)
https://doi.org/10.1007/3-540-48340-3_20
Mathematical Foundations of Computer Science 1998
Thomas Buchholz, Andreas Klein and Martin KutribLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1998 1450 807 (1998)
https://doi.org/10.1007/BFb0055832
Alternation on cellular automata
Martín MatamalaTheoretical Computer Science 180 (1-2) 229 (1997)
https://doi.org/10.1016/S0304-3975(96)00214-9
On real time one-way cellular array
Véronique TerrierTheoretical Computer Science 141 (1-2) 331 (1995)
https://doi.org/10.1016/0304-3975(94)00212-2
Nondeterministic, probabilistic and alternating computations on cellular array models
Kamala Krithivasan and Meena MahajanTheoretical Computer Science 143 (1) 23 (1995)
https://doi.org/10.1016/0304-3975(95)80023-3
Publications of K. Culik
RAIRO - Theoretical Informatics and Applications 28 (3-4) 425 (1994)https://doi.org/10.1051/ita/1994283-404251
Real time recognition with cellular automata : a meaningful example
V. TerrierRAIRO - Theoretical Informatics and Applications 27 (2) 97 (1993)
https://doi.org/10.1051/ita/1993270200971
Language classes defined by time-bounded relativised cellular automata
Meena Mahajan and Kamala KrithivasanRAIRO - Theoretical Informatics and Applications 27 (5) 403 (1993)
https://doi.org/10.1051/ita/1993270504031
Some results on time-varying and relativised cellular automata*
Meena Mahajan and Kamala KrithivasanInternational Journal of Computer Mathematics 43 (1-2) 21 (1992)
https://doi.org/10.1080/00207169208804070
Foundations of Software Technology and Theoretical Computer Science
Meena Mahajan and Kamala KrithivasanLecture Notes in Computer Science, Foundations of Software Technology and Theoretical Computer Science 560 172 (1991)
https://doi.org/10.1007/3-540-54967-6_68
On iterative and cellular tree arrays
Oscar H. Ibarra, Tao Jiang and Jik H. ChangJournal of Computer and System Sciences 38 (3) 452 (1989)
https://doi.org/10.1016/0022-0000(89)90011-1
Relating the power of cellular arrays to their closure properties
Oscar H. Ibarra and Tao JiangTheoretical Computer Science 57 (2-3) 225 (1988)
https://doi.org/10.1016/0304-3975(88)90040-0
Fault-tolerant schemes for some systolic systems
Karel Culik and Sheng YuInternational Journal of Computer Mathematics 22 (1) 13 (1987)
https://doi.org/10.1080/00207168708803579
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
Oscar H. Ibarra, Sam M. Kim and Shlomo MoranSIAM Journal on Computing 14 (2) 426 (1985)
https://doi.org/10.1137/0214033
Topological transformations as a tool in the design of systolic networks
Karel Culik and Ivan FrisTheoretical Computer Science 37 183 (1985)
https://doi.org/10.1016/0304-3975(85)90091-X