Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen

Mathematical Logic Quarterly 19 (14‐18):223-238 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Eine Einfache Universelle Menge Endlicher Automaten.Thomas Ottmann - 1978 - Mathematical Logic Quarterly 24 (1‐6):55-61.
Die Imitation Endlicher Medwedjew‐Automaten Durch Nervennetze.Peter H. Starke - 1965 - Mathematical Logic Quarterly 11 (3):241-248.
Der nomische Allsatz.Ota Weinberger - 1977 - Grazer Philosophische Studien 4 (1):31-41.
Über Experimente an Automaten.Peter H. Starke - 1967 - Mathematical Logic Quarterly 13 (3‐5):67-80.
Über Diagnostische Strategien an Determinierten Automaten.Peter H. Starke - 1973 - Mathematical Logic Quarterly 19 (14‐18):271-276.

Analytics

Added to PP
2013-11-24

Downloads
6 (#1,269,929)

6 months
2 (#670,035)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references