Skip to main content
SpringerLink
Log in

An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton

  • Conference paper
  • First Online:
Book cover Developments in Language Theory (DLT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2450))

Included in the following conference series:

Abstract

It is shown that an infinite prime sequence can be generated in real-time by a cellular automaton having 1-bit inter-cell communications.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Arisawa: On the generation of integer series by the one-dimensional iterative arrays of finite state machines (in Japanese). The Trans. of IECE, 71/8 Vol.54-C, No.8, pp.759–766, (1971).

    Google Scholar 

  2. C. R. Dyer: One-Way Bounded Cellular Automata. Information and Control, Vol.44, pp.261–281, (1980).

    Article  MATH  MathSciNet  Google Scholar 

  3. P. C. Fischer: Generation of primes by a one-dimensional real-time iterative array. J. of ACM, Vol.12, No.3, pp.388–394, (1965).

    Article  MATH  Google Scholar 

  4. I. Korec: Real-time generation of primes by a one-dimensional cellular automaton with 11 states. Proc. of 22nd Intern. Symp. on MFCS’ 97, Lecture Notes in Computer Science, 1295, pp.358–367, (1997).

    Google Scholar 

  5. J. Mazoyer: A minimal time solution to the firing squad synchronization problem with only one bit of information exchanged. Technical report of Ecole Normale Superieure de Lyon, No.89-03, pp.51, April, (1989).

    Google Scholar 

  6. J. Mazoyer: On optimal solutions to the firing squad synchronization problem. Theoret. Comput. Sci., 168, pp.367–404, (1996).

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Mazoyer and V. Terrier: Signals in one-dimensional cellular automata. Theoretical Computer Science, 217, pp.53–80, (1999).

    Article  MATH  MathSciNet  Google Scholar 

  8. A. R. Smith: Real-time language recognition by one-dimensional cellular automata. J. of Computer and System Sciences, 6, pp.233–253, (1972).

    MATH  Google Scholar 

  9. V. Terrier: On real-time one-way cellular array. Theoretical Computer Science, 141, pp.331–335, (1995).

    Article  MATH  MathSciNet  Google Scholar 

  10. V. Terrier: Language not recognizable in real time by one-way cellular automata. Theoretical Computer Science, 156, pp.281–287, (1996).

    Article  MATH  MathSciNet  Google Scholar 

  11. H. Umeo: Cellular Algorithms with 1-Bit Inter-Cell Communications. Proc. of MFCS’98 Satellite Workshop on Cellular Automata (Eds. T. Worsch and R. Vollmar), pp.93–104, Interner Bericht 19/98, University of Karlsruhe, (1998).

    Google Scholar 

  12. H. Umeo and M. Inada: A Design of Cellular Algorithms for 1-Bit Inter-Cell Communications. Proc. of the Fifth International Workshop on Parallel Image Analysis, IWPIA’97, pp.51–62, (1997).

    Google Scholar 

  13. H. Umeo: Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton. Parallel Computing, 27, pp.587–599, (2001).

    Article  MATH  MathSciNet  Google Scholar 

  14. H. Umeo and N. Kamikawa: A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications. Fundamenta Informaticae, 52, No.1–3, pp.255–273, (2002).

    MathSciNet  Google Scholar 

  15. T. Worsch: Linear Time Language Recognition on Cellular Automata with Restricted Communication, Proc. of LATIN 2000:Theoretical Informatics (Eds. G. H. Gonnet, D. Panario and A. Viola), LNCS 1776, pp.417–426, (2000).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Osaka Electro-Communication Univ., Neyagawa-shi, Hastu-cho, 18-8, 572-8530, Osaka, Japan

    Hiroshi Umeo

  2. Noritsu Koki Co. Ltd., 640-8550, Umehara, Wakayama-shi, Japan

    Naoki Kamikawa

Authors
  1. Hiroshi Umeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naoki Kamikawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Umeo, H., Kamikawa, N. (2003). An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

  • Online ISBN: 978-3-540-45005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation