Skip to main content
SpringerLink
Log in

Arrays, automata and groups — Some interconnections

  • Conference paper
  • First Online:
Automata Networks (LITP 1986)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. R. Berger, The Undecidability of the Domino Problem, Memoirs Amer. Math. Soc. 66, Providence, 1966

    Google Scholar 

  2. A. Beardon, The Geometry of Discrete Groups, Springer-Verlag, Heidelberg, 1986

    Google Scholar 

  3. M. Gromov, Groups of polynomial growth and expending maps, Publ. IHES 53 (1981), pp. 53–78.

    Google Scholar 

  4. E.S. Golod and I.R. Shafarevitch, On towers of class fields, Izv. Akad. Nauk SSSR, ser. Math. 28 (1964), pp. 261–272.

    Google Scholar 

  5. W. Magnus, A. Karrass and D. Solitar, Combinatorial group theory, Wiley, New York, 1960.

    Google Scholar 

  6. J. Milnor, A note on curvature and the fundamental group, J. Diff. Geometry 2 (1968), pp. 1–7.

    Google Scholar 

  7. E.F. Moore, Machine models of self-reproduction, in Symposium Applied Math., vol. XIV, Amer. Math. Soc., Providence 1962, pp. 17–33.

    Google Scholar 

  8. D.E. Muller and P.E. Schupp, Groups, the theory of ends, and context-free languages, J. Comp. Sys. Sciences 26 (1983), pp. 295–310.

    Google Scholar 

  9. D.E. Muller and P.E. Schupp, Ends, pushdown automata and second-order logic, Theor. Comp. Science 37 (1985), pp. 51–75.

    Google Scholar 

  10. J. Myhill, The converse of Moore's Garden of Eden theorem, Proc. Amer. Math. Soc. 14 (1963), pp. 685–686.

    Google Scholar 

  11. P.S. Novikov and S.I. Adyan, On infinite periodic groups, I, II, III, Izv. Akad. Nauk SSSR, Ser. Mat. 32 (1968), pp. 209–236, 241–479, 709–731.

    Google Scholar 

  12. M. O. Rabin, Decidability of second-order theories and automata in infinite trees, Trans. Amer. Math. Soc. 141 (1969), pp. 1–35.

    Google Scholar 

  13. J. Reif and A.P. Sistta, A multiprocess network logic with temporal and spatial modalities, J. Comp. Sys. Sciences 30 (1985), pp. 41–53.

    Google Scholar 

  14. R.M. Robinson, Undecidability and nonperiodicity for tilings of the plane, Invent. Math. 12 (1971), pp. 177–209.

    Article  Google Scholar 

  15. A.P. Stolboushkin et M.A. Taitslin, Deterministic dynamic logic is weaker than dynamic logic, Information and Control 57 (1983), pp. 48–55.

    Google Scholar 

  16. John von Neumann, The theory of self-reproducing automata, (edited by A. Burks), University of Illinois Press, Urbana, 1966.

    Google Scholar 

  17. H. Wang, Proving theorems by pattern recognition II, Bell System Technical Journal 40 (1961), pp. 1–41.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Illinois, Université Paris 7, USA

    Paul E. Schupp

Authors
  1. Paul E. Schupp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. Choffrut

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schupp, P.E. (1988). Arrays, automata and groups — Some interconnections. In: Choffrut, C. (eds) Automata Networks. LITP 1986. Lecture Notes in Computer Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19444-4_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-19444-4_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39270-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation