{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:37:26Z","timestamp":1725856646895},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319336923"},{"type":"electronic","value":"9783319336930"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33693-0_16","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T01:35:47Z","timestamp":1464053747000},"page":"245-259","source":"Crossref","is-referenced-by-count":1,"title":["Deciding Monadic Second Order Logic over $$\\omega $$ \u03c9 -Words by Specialized Finite Automata"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Barth","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Barth, S., Hofmann, M.: Learn with SAT to minimize B\u00fcchi automata. In: Faella, M., Murano, A. (eds.) GandALF. EPTCS, vol. 96, pp. 71\u201384 (2012)","DOI":"10.4204\/EPTCS.96.6"},{"issue":"5","key":"16_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s00236-009-0094-7","volume":"46","author":"D Bresolin","year":"2009","unstructured":"Bresolin, D., Montanari, A., Puppis, G.: A theory of ultimately periodic languages and automata with an application to time granularity. Acta Informatica 46(5), 331\u2013360 (2009)","journal-title":"Acta Informatica"},{"key":"16_CR3","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Nagel, E., Suppes, P., Tarski, A. (eds.) Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science (LMPS 1960), pp. 1\u201311. Stanford University Press, June 1962"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/3-540-58027-1_27","volume-title":"Mathematical Foundations of Programming Semantics","author":"H Calbrix","year":"1994","unstructured":"Calbrix, H., Nivat, M., Podelski, A.: Ultimately periodic words of rational omega-languages. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 554\u2013566. Springer, Heidelberg (1994). doi: 10.1007\/3-540-58027-1_27"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-642-14186-7_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"R Ehlers","year":"2010","unstructured":"Ehlers, R.: Minimising deterministic B\u00fcchi automata precisely using SAT solving. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 326\u2013332. Springer, Heidelberg (2010)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-642-16164-3_10","volume-title":"Model Checking Software","author":"R Ehlers","year":"2010","unstructured":"Ehlers, R., Finkbeiner, B.: On the virtue of patience: minimizing B\u00fcchi automata. In: Pol, J., Weber, M. (eds.) SPIN 2010. LNCS, vol. 6349, pp. 129\u2013145. Springer, Heidelberg (2010)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-3-540-78800-3_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Farzan","year":"2008","unstructured":"Farzan, A., Chen, Y.-F., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Extending\u00a0automated\u00a0compositional\u00a0verification to the full class of omega-regular languages. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 2\u201317. Springer, Heidelberg (2008)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-60630-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"JG Henriksen","year":"1995","unstructured":"Henriksen, J.G., Jensen, J., J\u00f8rgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: monadic second-order logic in practice. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 89\u2013110. Springer, Heidelberg (1995)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An $$n \\log n$$ n log n algorithm for minimizing states in a finite automaton. Technical report CS-TR-71-190, Stanford University (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","first-page":"571","volume-title":"Implementation and Application of Automata","author":"N Klarlund","year":"2001","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA implementation secrets. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 571\u2013586. Springer, Heidelberg (2001)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: FOCS, pp. 254\u2013266. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.16"},{"key":"16_CR12","unstructured":"Schewe, S.: Minimisation of deterministic parity and buchi automata and relative minimisation of deterministic finite automata. CoRR, abs\/1007.1333 (2010)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-642-18098-9_28","volume-title":"Implementation and Application of Automata","author":"M-H Tsai","year":"2011","unstructured":"Tsai, M.-H., Fogarty, S., Vardi, M.Y., Tsay, Y.-K.: State of B\u00fcchi complementation. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 261\u2013271. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33693-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T14:33:10Z","timestamp":1567953190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33693-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319336923","9783319336930"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33693-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}