Zur endlichen Approximierbarkeit sequentieller Systeme

  • Rüdiger Valk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)


Dann Gilt Gilt Nach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

7. Literatur

  1. [BGT]
    BOURBAKI, N., General Topology, Hermann, Paris 1966Google Scholar
  2. [BI]
    BÖHLING, K.H., INDERMARK, K., Endliche Automaten I, BI, Mannheim 1969Google Scholar
  3. [KAF]
    KALMAN, R.E., ARBIB, M.A., FALB, P.L., Topics in Mathematical Systems Theory, McGraw Hill, New York 1969Google Scholar
  4. [KW]
    KUPKA, I., WILSING, N., A formal framework for dialog languages, Bericht Nr.2, Institut für Informatik, Hamburg 1972Google Scholar
  5. [MT]
    MESAROVIC, M.D., TAKAHARA, Y., General Systems Theory: Mathematical Foundations, Academic Press, New York 1975Google Scholar
  6. [V1]
    VALK, R., The Use of Metric and Uniform Spaces for the Formalization of Behavioral Proximity of States, in 1.GI-Fachtagung Automatentheorie und formale Sprachen, Lecture Notes in Computer Science No 2, Springer, Berlin 1973Google Scholar
  7. [V2]
    VALK,R., Realisierungen allgemeiner Systeme, erscheint als GMD-BerichtGoogle Scholar
  8. [V3]
    VALK, R., On some Elementary Properties of Uniform Automata, erscheint in Revue Francaise d'Automatique Informatique Recherche OperationnelleGoogle Scholar
  9. [V4]
    VALK,R., Zeitkontinuierliche topologische Automaten, zur Veröffentlichung vorbereitetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Rüdiger Valk
    • 1
  1. 1.Institut für InformatikUniversität HamburgHamburg 13

Personalised recommendations