{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:56:20Z","timestamp":1725652580999},"publisher-location":"Wiesbaden","reference-count":20,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783528057206"},{"type":"electronic","value":"9783322830920"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-322-83092-0_16","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T10:14:35Z","timestamp":1326708875000},"page":"282-300","source":"Crossref","is-referenced-by-count":0,"title":["Die Logiken von Boole und B\u00fcchi-Elgot-Trakhtenbrot in der Beschreibung diskreter Systeme"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Thomas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. 1974."},{"key":"16_CR2","first-page":"31","volume-title":"Lecture Notes in Computer Science","author":"D Basin","year":"1995","unstructured":"D. Basin, N. Klarlund, Hardware-verification using monadic second-order logic, in: Computer Aided Verification (P. Wolper, Ed.), Lecture Notes in Computer Science 939, Springer-Verlag, Berlin 1995, pp. 31\u201341."},{"key":"16_CR3","volume-title":"An Investigation of the Laws of Thought","author":"G Boole","year":"1854","unstructured":"G. Boole, An Investigation of the Laws of Thought, Walton and Marberly, London 1854."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R Bryant","year":"1992","unstructured":"R. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Computing Surveys\n              24 (1992), 293\u2013318.","journal-title":"ACM Computing Surveys"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"J.R. B\u00fcchi, Weak second-order arithmetic and finite automata, Z. Math. Logik Grundl. Math.\n              6 (1960), 66\u201392.","journal-title":"Z. Math. Logik Grundl. Math."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"T9","DOI":"10.1002\/zamm.19620420104","volume":"42","author":"JR B\u00fcchi","year":"1962","unstructured":"J.R. B\u00fcchi, Mathematische Theorie des Verhaltens endlicher Automaten, Zeitschrift f\u00fcr Angew. Math. und Mechanik\n              42 (1962), T9\u2013T16.","journal-title":"Zeitschrift f\u00fcr Angew. Math. und Mechanik"},{"key":"16_CR7","first-page":"834","volume":"5","author":"JR B\u00fcchi","year":"1958","unstructured":"J.R. B\u00fcchi, C.C. Elgot, Decision problems of weak second order arithmetics and finite automata, Part I, Notices Amer. Math. Soc.\n              5 (1958), 834.","journal-title":"Notices Amer. Math. Soc."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"C.C. Elgot, Decision problems of finite automata design and related arithmetics, Trans. Amer. Math. Soc.\n              98 (1961), 21\u201351.","journal-title":"Trans. Amer. Math. Soc."},{"key":"16_CR9","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass. 1979."},{"key":"16_CR10","first-page":"311","volume-title":"Lecture Notes in Computer Science","author":"N Klarlund","year":"1998","unstructured":"N. Klarlund, Mona & Fido: The logic-automaton connection in practice, in: Computer Science Logic (M. Nielsen, W. Thomas, Eds.), Lecture Notes in Computer Science 1414, Springer-Verlag, Berlin 1998, pp. 311\u2013326."},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"KL McMillan","year":"1993","unstructured":"K. L. McMillan, Symbolic Model Checking, Kluwer Acad. Publ., Boston 1993."},{"key":"16_CR12","first-page":"132","volume-title":"Lecture Notes in Computer Science","author":"AR Meyer","year":"1975","unstructured":"A.R. Meyer, Weak monadic second-order theory of successor is not elementary recursive, in: Logic Colloquium, Proc. Symp. on Logic, Boston, 1972 (R. Parikh, Ed.), Lecture Notes in Computer Science 453, Springer-Verlag, Berlin 1975, pp. 132\u2013154."},{"key":"16_CR13","unstructured":"O. Matz, N. Schweikardt, W. Thomas, The monadic quantifier alternation hierarchy over grids and graphs, Information and Computation (erscheint)."},{"key":"16_CR14","unstructured":"J. Myhill, Finite automata and representation of events, WADC Rep. TR 57-624, Fundamental Concepts in the Theory of Systems, 1957, pp. 112-137."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"M.O. Rabin, D. Scott, Finite automata and their decision problems, IBM J. Research and Development\n              3 (1959), 114\u2013125.","journal-title":"IBM J. Research and Development"},{"key":"16_CR16","unstructured":"L.H. Stockmeyer, The Complexity of Decision Problems in Automata Theory and Logic, PhD Thesis, Dep. of Electr. Eng., MIT, Cambridge, Mass. 1974."},{"key":"16_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"H Straubing","year":"1994","unstructured":"H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkh\u00e4user, Boston 1994."},{"key":"16_CR18","first-page":"135","volume-title":"Handbook of Theoretical Computer Science","author":"W Thomas","year":"1990","unstructured":"W. Thomas, Automata on infinite objects, in: Handbook of Theoretical Computer Science, Vol. b (J.v. Leeuwen, Ed.), Elsevier Sci. Publ., Amsterdam 1990, pp. 135\u2013191."},{"key":"16_CR19","first-page":"646","volume":"118","author":"BA Trakhtenbrot","year":"1958","unstructured":"B.A. Trakhtenbrot, The synthesis of logical nets whose operators are described in terms of one-place predicate calculus, Dokl. Akad. Nauk SSSR\n              118 (1958), 646\u2013649 (in Russisch).","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"16_CR20","first-page":"103","volume":"3","author":"BA Trakhtenbrot","year":"1962","unstructured":"B.A. Trakhtenbrot, Finite automata and the logic of one-place predicates, Sib. Math. J.\n              3 (1962), 103\u2013131 in Russisch). Engl. Transl.: AMS Transl.\n              59 (1966), 23-55.","journal-title":"Sib. Math. J."}],"container-title":["Angewandte Mathematik, insbesondere Informatik"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-83092-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T17:17:57Z","timestamp":1619975877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-83092-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783528057206","9783322830920"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-83092-0_16","relation":{},"subject":[],"published":{"date-parts":[[1999]]}}}