Language Recognition by Cellular Automata-Reference-Cited by-同舟云学术

Language Recognition by Cellular Automata

Published:2012 Issue: Volume: Page:123-158
ISSN:
Container-title:Handbook of Natural Computing
language:
Short-container-title:

Author:

Terrier Véronique

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-92910-9_4.pdf

Reference51 articles.

1. Beyer WT (1969) Recognition of topological invariants by iterative arrays. Technical Report AITR-229, MIT Artificial Intelligence Laboratory, October 1, 1969

2. Bucher W, Čulik K II (1984) On real time and linear time cellular automata. RAIRO Theor Inf Appl 81:307–325

3. Buchholz T, Kutrib M (1998) On time computability of functions in one-way cellular automata. Acta Inf 35(4):329–352

4. Buchholz T, Klein A, Kutrib M (2000) Iterative arrays with small time bounds. In: Nielsen M, Rovan B (eds) MFCS, Lecture notes in computer science, vol 1893. Springer, Berlin, Heidelberg, pp 243–252

5. Cervelle J, Formenti E (2009) Algorithmic complexity and cellular automata. In: Meyers RA (ed) Encyclopedia of complexity and system science. Springer, New York

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inductive definitions in logic versus programs of real-time cellular automata;Theoretical Computer Science;2024-03

2. Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata;International Journal of Foundations of Computer Science;2021-07-09

3. On Hardest Languages for One-Dimensional Cellular Automata;Language and Automata Theory and Applications;2021

4. Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata;Developments in Language Theory;2020

5. Counter Machines and Distributed Automata;Cellular Automata and Discrete Complex Systems;2018