Advertisement

Complexity of loop-problems in normed networks

  • H. Kleine Büning
Section III: Automata And Machines
Part of the Lecture Notes in Computer Science book series (LNCS, volume 171)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. (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. (2).
    Garey, M.R., Johnson, D.S. 1979 "Computer and Intractability", W.H. Freeman and Company, San FranciscoGoogle Scholar
  3. (3).
    Kleine Büning, H., Ottmann, Th. 1977, "Kleine universelle mehrdimensionale Turingmaschinen", EIK 13 (1977)Google Scholar
  4. (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. (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, LNCSGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • H. Kleine Büning
    • 1
  1. 1.Institut für Angewandte Informatik und Formale BeschreibungsverfahrenUniversität KarlsruheKarlsruhe

Personalised recommendations