{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T06:18:35Z","timestamp":1784528315866,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130885","type":"print"},{"value":"9783642130892","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13089-2_10","type":"book-chapter","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T12:05:27Z","timestamp":1273233927000},"page":"118-129","source":"Crossref","is-referenced-by-count":12,"title":["Equivalence and Inclusion Problem for Strongly Unambiguous B\u00fcchi Automata"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bousquet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, New York (1974)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(83)90086-5","volume":"26","author":"A. Arnold","year":"1983","unstructured":"Arnold, A.: Rational \u03c9-languages are non-ambiguous. Theoretical Computer Science\u00a026, 221\u2013223 (1983)","journal-title":"Theoretical Computer Science"},{"key":"10_CR3","volume-title":"Principles of Model Checking","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"10_CR4","first-page":"1","volume-title":"International Congress on Logic, Methodology and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University Press, Stanford (1962)"},{"key":"10_CR5","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 \u03c9-languages. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol.\u00a0802, pp. 554\u2013566. Springer, Heidelberg (1994)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-74915-8_15","volume-title":"Computer Science Logic","author":"A. Carayol","year":"2007","unstructured":"Carayol, A., L\u00f6ding, C.: MSO on the infinite binary tree: Choice and order. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 161\u2013176. Springer, Heidelberg (2007)"},{"issue":"1-3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0304-3975(02)00618-7","volume":"297","author":"O. Carton","year":"2003","unstructured":"Carton, O., Michel, M.: Unambiguous B\u00fcchi automata. Theor. Comput. Sci.\u00a0297(1-3), 37\u201381 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., L\u00f6ding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, \n                    \n                      http:\/\/tata.gforge.inria.fr\/\n                    \n                    \n                   (last release: October 12, 2007)"},{"key":"10_CR9","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"Landweber, L.H.: Decision problems for \u03c9-automata. Mathematical Systems Theory\u00a03, 376\u2013384 (1969)","journal-title":"Mathematical Systems Theory"},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control\u00a09(5), 521\u2013530 (1966)","journal-title":"Information and Control"},{"key":"10_CR12","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Ambiguity problem for automata on infinite trees (unpublished note)"},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"Seidl, H.: Deciding equivalence of finite tree automata. SIAM J. Comput.\u00a019(3), 424\u2013437 (1990)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R.E. Stearns","year":"1985","unstructured":"Stearns, R.E., Hunt III, H.B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM Journal on Computing\u00a014(3), 598\u2013611 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR15","unstructured":"Stockmeyer, L.J.: The Complexity of Decision Problems in Automata Theory and Logic. PhD thesis, Dept. of Electrical Engineering, MIT, Boston, Mass. (1974)"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Language Theory","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol.\u00a0III, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","volume":"5","author":"L.G. Valiant","year":"1976","unstructured":"Valiant, L.G.: Relative complexity of checking and evaluating. Inf. Process. Lett.\u00a05(1), 20\u201323 (1976)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13089-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:54:31Z","timestamp":1619783671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13089-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130885","9783642130892"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13089-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}