Skip to main content
SpringerLink
Log in

Continuous Relations and Richardson’s Theorem

  • Conference paper
Relational and Algebraic Methods in Computer Science (RAMICS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7560))

Abstract

The paper intends to seek a definition of continuous relations with relational methods and gives another proof of Richardson’s theorem on nondeterministic cellular automata.

This work was supported in part by Grants-in-Aid for Scientific Research (C) 22500016 from Japan Society for the Promotion of Science (JSPS).

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. Brattka, V., Hertling, P.: Continuity and computability of relations. Informatik Berichte, vol. 164. FernUniversität in Hagen (1994)

    Google Scholar 

  2. Ceccherini-Silberstein, T., Coornaert, M.: Cellular automata and groups. Springer (2010)

    Google Scholar 

  3. Choquet, G.: Convergence. Annales de l’université de Grenoble 23, 57–112 (1947-1948)

    MathSciNet  Google Scholar 

  4. Desharnais, J.: Monomorphic characterization of n-ary direct products. Information Sciences 119(3-4), 275–288 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Freyd, P., Scedrov, A.: Categories, allegories. North-Holland, Amsterdam (1990)

    MATH  Google Scholar 

  6. Richardson, D.: Tessellations with local transformations. J. Computer and System Sciences 6, 373–388 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  7. Schmidt, G., Ströhlein, T.: Relations and graphs, Discrete Mathematics for Computer Scientists. EATCS-Monographs on Theoret. Comput. Sci. Springer, Berlin (1993)

    MATH  Google Scholar 

  8. Wolfram, S.: A new kind of science. Wolfram Media (2002)

    Google Scholar 

  9. Ziegler, M.: Relative computability and uniform continuity of relations. Logic seminar 2011, Technische Universität Darmstadt (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Kagoshima University, Kagoshima, Japan

    Hitoshi Furusawa & Yasuo Kawahara

  2. Center for Fundamental Education, Kyushu Sangyo University, Fukuoka, Japan

    Toshikazu Ishida

Authors
  1. Hitoshi Furusawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshikazu Ishida
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yasuo Kawahara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing and Software, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada

    Wolfram Kahl

  2. Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, CB3 0FD, Cambridge, UK

    Timothy G. Griffin

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Furusawa, H., Ishida, T., Kawahara, Y. (2012). Continuous Relations and Richardson’s Theorem. In: Kahl, W., Griffin, T.G. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2012. Lecture Notes in Computer Science, vol 7560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33314-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33314-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33313-2

  • Online ISBN: 978-3-642-33314-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation