{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:55Z","timestamp":1725577435550},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_20","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"181-190","source":"Crossref","is-referenced-by-count":1,"title":["Partially Ordered Two-Way B\u00fcchi Automata"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Kufleitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Lauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Principles of Model Checking","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"key":"20_CR2","first-page":"1","volume-title":"Proc. Int. Congr. for 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: Proc. Int. Congr. for Logic, Methodology, and Philosophy of Science, pp. 1\u201311. Stanford Univ. Press, Stanford (1962)"},{"key":"20_CR3","volume-title":"Model Checking","author":"E.M. Clarke Jr.","year":"1999","unstructured":"Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"20_CR4","unstructured":"Diekert, V., Kufleitner, M.: Fragments of first-order logic over infinite words. In: STACS 2009. Dagstuhl Seminar Proceedings, vol.\u00a009001, pp. 325\u2013336 (2009)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/11549345_47","volume-title":"Mathematical Foundations of Computer Science 2005","author":"C.A. Kapoutsis","year":"2005","unstructured":"Kapoutsis, C.A.: Removing bidirectionality from nondeterministic finite automata. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 544\u2013555. Springer, Heidelberg (2005)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Kufleitner, M., Lauser, A.: Partially ordered two-way B\u00fcchi automata. Technical report no.\u00a02010\/03, Universit\u00e4t Stuttgart, Informatik (2010)","DOI":"10.1007\/978-3-642-18098-9_20"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-44685-0_35","volume-title":"CONCUR 2001 - Concurrency Theory","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: Extended temporal logic revisited. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 519\u2013535. Springer, Heidelberg (2001)"},{"key":"20_CR8","first-page":"461","volume":"273","author":"K. Lodaya","year":"2008","unstructured":"Lodaya, K., Pandya, P.K., Shah, S.S.: Marking the chops: An unambiguous temporal logic. IFIP TCS\u00a0273, 461\u2013476 (2008)","journal-title":"IFIP TCS"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-14455-4_28","volume-title":"Developments in Language Theory","author":"K. Lodaya","year":"2010","unstructured":"Lodaya, K., Pandya, P.K., Shah, S.S.: Around dot depth two. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 305\u2013316. Springer, Heidelberg (2010)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(85)90009-X","volume":"35","author":"J.-P. P\u00e9cuchet","year":"1985","unstructured":"P\u00e9cuchet, J.-P.: Automates boustroph\u00e9don et mots infinis. Theoretical Computer Science\u00a035, 115\u2013122 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF02679467","volume":"30","author":"J.-\u00c9. Pin","year":"1997","unstructured":"Pin, J.-\u00c9., Weil, P.: Polynomial closure and unambiguous product. Theory of Computing Systems\u00a030(4), 383\u2013422 (1997)","journal-title":"Theory of Computing Systems"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-46011-X_20","volume-title":"Developments in Language Theory","author":"T. Schwentick","year":"2002","unstructured":"Schwentick, T., Th\u00e9rien, D., Vollmer, H.: Partially-ordered two-way automata: A new characterization of DA. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 239\u2013250. Springer, Heidelberg (2002)"},{"issue":"2-3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A.P. Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.L.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoretical Computer Science\u00a049(2-3), 217\u2013237 (1987)","journal-title":"Theoretical Computer Science"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Th\u00e9rien, D., Wilke, T.: Over words, two variables are as powerful as one quantifier alternation. In: STOC 1998, pp. 234\u2013240 (1998)","DOI":"10.1145\/276698.276749"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences\u00a025, 360\u2013376 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013641. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T14:57:52Z","timestamp":1637247472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}