View Item 

Show simple item record

Mathematische Theorie des Verhaltens endlicher Automaten
dc.contributor.authorBüchi, J. Richauden_US
dc.date.accessioned2012-10-02T17:20:06Z
dc.date.available2012-10-02T17:20:06Z
dc.date.issued1962en_US
dc.identifier.citationBüchi, J. Richaud (1962). "Mathematische Theorie des Verhaltens endlicher Automaten ." ZAMM â Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik 42(S1): T9-T16. <http://hdl.handle.net/2027.42/93682>en_US
dc.identifier.issn0044-2267en_US
dc.identifier.issn1521-4001en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/93682
dc.publisherWILEY‐VCH Verlagen_US
dc.titleMathematische Theorie des Verhaltens endlicher Automatenen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumUniversity of Michigan, Ann Arbor und Gutenberg‐Universität, Mainzen_US
dc.contributor.affiliationotherMainz, Mathematisches Institut der Universitäten_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/93682/1/19620420106_ftp.pdf
dc.identifier.doi10.1002/zamm.19620421306en_US
dc.identifier.sourceZAMM ‐ Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechaniken_US
dc.identifier.citedreferenceA. Church, Application of Recursive Arithmetic to the Problem of Circuit Synthesis,Proceedings of the Cornell Logic Conference, Cornell University, 1957. Also see Application of Recursive Arithmetic in the Theory of Computing and Automata, Notes for a summer course, The University of Michigan, 1959.en_US
dc.identifier.citedreferenceI. M. Copi, C. C. Elgot and J. B. Wright, Realization of Events by Logical Nets, Journal Ass. Comp. Mach, 5 ( 1958 ),S. 181 – 196.en_US
dc.identifier.citedreferenceJ. Friedman, Some Results in Church's Restricted Recursive Arithmetic, The Journal of Symbolic Logic 22 ( 1957 ),S. 337 – 342.en_US
dc.identifier.citedreferenceS. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies, Princeton University Press, 1956,S. 3 – 41.en_US
dc.identifier.citedreferenceI. T. Medvedev, On a Class of Events Representable in a Finite Automaton,MIT Lincoln Laborators Group Report,S. 34 – 73,translated from the Russian by J. Schorr‐Kon, 1958.en_US
dc.identifier.citedreferenceJ. Myhill, Finite Automata and Representation of Events,WADC Report TR 57‐624, Fundamental Concepts in the Theory of Systems, 1957,S. 112 – 137.en_US
dc.identifier.citedreferenceE. F. Moore, Gedanken‐Experiments on Sequential Machines, Automata Studies, Princeton 1956,S. 129 bis 153.en_US
dc.identifier.citedreferenceE. L. Post, Introduction to a General Theory of Elementary Propositions, Amer. Jour. Math. 43 ( 1921 ),S. 163 – 185.en_US
dc.identifier.citedreferenceE. L. Post, Recursive Unsolvability of a Problem of Thue, Journal of Symbolic Logic 12 ( 1947 ),S. 1 – 11.en_US
dc.identifier.citedreferenceM. Rabin and D. Scott, Finite Automata and Their Decision Problems,IBM Journal,April 1959,S. 114 bis 125.en_US
dc.identifier.citedreferenceP. C. Rosenbloom, The Elements of Mathematical Logic, Dover 1950.en_US
dc.identifier.citedreferenceA. Thue, Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln, Skrifter utgit av Videnskapsselskapet i Kristiania,I. Matematisk‐naturvidens‐kabelig klasse, No. 10( 1914 ), 34S.en_US
dc.identifier.citedreferenceHao Wang, Circuit Synthesis by Solving Sequential Boolean Equations, Zeitsch. für Math. Logik und Grundl. der Math. 5 ( 1959 ),S. 291 – 322.en_US
dc.identifier.citedreferenceJ. R. Büchi, A Decision Method for Sequential Calculus,Proceedings of the International Congress for Logic, Methodology, and the Philosophy of Science, Stanford University, 1960,S. 1 – 11.en_US
dc.identifier.citedreferenceJ. R. Büchi, Weak Second Order Arithmetic and Finite Automata, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6 ( 1960 ),S. 66 – 92.en_US
dc.identifier.citedreferenceJ. R. Büchi, Regular Canonical Systems,University of Michigan Research Institute Technical Report 2794‐7‐T, 1959. To appear in Archiv für Mathematische Logik, 1962.en_US
dc.identifier.citedreferenceBüchi, Elgot and Wright, The Non‐existence of Certain Algorithms of Finite Automata Theory, Abstract, Notices of the American Mathematical Society 5 ( 1958 ),S. 98.en_US
dc.identifier.citedreferenceA. W. Burks and J. B. Wright, Sequence Generators and Digital Computers,Proceedings, Symposium on Recursive Functions, Am. Math. Soc., New York 1961.en_US
dc.identifier.citedreferenceA. W. Burks and J. B., Wright Theory of Logical Nets, Proc. IRE 41 ( 1953 ),S. 1357 – 1365.en_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
19620420106_ftp.pdf
Size:
727.8KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.