Skip to main content
SpringerLink
Log in

Complexity of loop-problems in normed networks

  • Section III: Automata And Machines
  • Conference paper
  • First Online:
Logic and Machines: Decision Problems and Complexity (LaM 1983)

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

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.

References

  1. Karp, R.M. 1972, "Reducibility among combinatorial problems", in R.E. Miller, J.W. Thatcher (eds.) Complexity of Computer Computations, Plenum Press, New York, 85–103.

    Google Scholar 

  2. Garey, M.R., Johnson, D.S. 1979 "Computer and Intractability", W.H. Freeman and Company, San Francisco

    Google Scholar 

  3. Kleine Büning, H., Ottmann, Th. 1977, "Kleine universelle mehrdimensionale Turingmaschinen", EIK 13 (1977)

    Google Scholar 

  4. Ottmann, Th., 1973, "Über Möglichkeiten zur Simulation endlicher Automaten durch eine Art sequentieller Netzwerke aus einfachen Bausteinen", ZMLG 19 (1973)

    Google Scholar 

  5. Priese,L., Rödding, D., Schätz, D., Brüggemann, A., "Modular Decomposition of Automata", in Börger, E., Hasenjäger, G., Rödding, D. (eds), Proceedings of the Symposium "Rekursive Kombinatorik", Münster 1983, LNCS

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, Postfach 6380, 7500, Karlsruhe

    H. Kleine Büning

Authors
  1. H. Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Büning, H.K. (1984). Complexity of loop-problems in normed networks. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation