Linear Time Language Recognition on Cellular Automata with Restricted Communication-Reference-Cited by-同舟云学术

Linear Time Language Recognition on Cellular Automata with Restricted Communication

Published:2000 Issue: Volume: Page:417-426
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Worsch Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10719839_41

Reference5 articles.

1. Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions on Computers C-18(4), 349–365 (1969)

2. Mazoyer, J.: A minimal time solution to the firing squad synchronization problem with only one bit of information exchanged. Technical Report TR 89-03, Ecole Normale Supérieure de Lyon, Lyon (1989)

3. Smith III, A.R.: Cellular automata complexity trade-offs. Information and Control 18, 466–482 (1971)

4. Umeo, H.: Cellular algorithms with 1-bit inter-cell communications. In: Worsch, T., Vollmar, R. (eds.) MFCS 1998 Satellite Workshop on Cellular Automata, pp. 93–104 (1998)

5. Vollmar, R., Worsch, T.: Modelle der Parallelverarbeitung – eine Einführung. Teubner, Stuttgart (1995)

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

1. Cellular Automata: Communication Matters;Lecture Notes in Computer Science;2024

2. Iterative arrays with finite inter-cell communication;Natural Computing;2020-10-24

3. Hierarchies and undecidability results for iterative arrays with sparse communication;Natural Computing;2019-11-25

4. Iterative Arrays with Finite Inter-cell Communication;Cellular Automata and Discrete Complex Systems;2019

5. Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication;Cellular Automata and Discrete Complex Systems;2018