{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:51:39Z","timestamp":1725907899386},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662557501"},{"type":"electronic","value":"9783662557518"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-662-55751-8_27","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:32:49Z","timestamp":1502796769000},"page":"341-354","source":"Crossref","is-referenced-by-count":0,"title":["Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words"],"prefix":"10.1007","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Spinrath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10009-011-0216-8","volume":"14","author":"PA Abdulla","year":"2012","unstructured":"Abdulla, P.A.: Regular model checking. STTT 14(2), 109\u2013118 (2012). doi:\n10.1007\/s10009-011-0216-8","journal-title":"STTT"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, pp. 202\u2013211. ACM (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/11672142_34","volume-title":"STACS 2006","author":"V B\u00e1r\u00e1ny","year":"2006","unstructured":"B\u00e1r\u00e1ny, V., L\u00f6ding, C., Serre, O.: Regularity problems for visibly pushdown languages. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 420\u2013431. Springer, Heidelberg (2006). doi:\n10.1007\/11672142_34"},{"key":"27_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Springer, Stuttgart (1979)"},{"issue":"2","key":"27_CR5","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/S0022-0000(73)80045-5","volume":"7","author":"M Bird","year":"1973","unstructured":"Bird, M.: The equivalence problem for deterministic two-tape automata. J. Comput. Syst. Sci. 7(2), 218\u2013236 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: Proceedings of the 15th IEEE Symposium on Logic in Computer Science, LICS 2000, pp. 51\u201362. IEEE Computer Society Press (2000)","DOI":"10.1109\/LICS.2000.855755"},{"key":"27_CR7","doi-asserted-by":"publisher","unstructured":"B\u00f6hm, S., G\u00f6ller, S., Halfon, S., Hofman, P.: On B\u00fcchi one-counter automata. In: Vollmer, H., Vall\u00e9e, B. (eds.) 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 66, pp. 14:1\u201314:13 (2017). doi:\n10.4230\/LIPIcs.STACS.2017.14\n\n. ISBN 978-3-95977-028-6","DOI":"10.4230\/LIPIcs.STACS.2017.14"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/1071596.1071601","volume":"6","author":"B Boigelot","year":"2005","unstructured":"Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans. Comput. Log. 6(3), 614\u2013633 (2005). doi:\n10.1145\/1071596.1071601","journal-title":"ACM Trans. Comput. Log."},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-540-24730-2_41","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Boigelot","year":"2004","unstructured":"Boigelot, B., Legay, A., Wolper, P.: Omega-regular model checking. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 561\u2013575. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-24730-2_41"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR \u201997: Concurrency Theory","author":"A Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997). doi:\n10.1007\/3-540-63141-0_10"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ic.2015.03.012","volume":"242","author":"L Bozzelli","year":"2015","unstructured":"Bozzelli, L., Maubert, B., Pinchinat, S.: Uniform strategies, rational relations and jumping automata. Inf. Comput. 242, 80\u2013107 (2015). doi:\n10.1016\/j.ic.2015.03.012","journal-title":"Inf. Comput."},{"key":"27_CR12","first-page":"1","volume-title":"Logic, Methodology, and Philosophy of Science: Proceedings of the 1960 International Congress","author":"JR B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Nagel, E. (ed.) Logic, Methodology, and Philosophy of Science: Proceedings of the 1960 International Congress, pp. 1\u201311. Stanford University Press, Palo Alto (1962)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 \n            $$\\omega $$\n          -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:\n10.1007\/3-540-58027-1_27"},{"issue":"02","key":"27_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1051\/ita:2006005","volume":"40","author":"O Carton","year":"2006","unstructured":"Carton, O., Choffrut, C., Grigorieff, S.: Decision problems among the main subfamilies of rational relations. RAIRO-Theor. Inform. Appl. 40(02), 255\u2013275 (2006)","journal-title":"RAIRO-Theor. Inform. Appl."},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/11779148_12","volume-title":"Developments in Language Theory","author":"D Caucal","year":"2006","unstructured":"Caucal, D.: Synchronization of pushdown automata. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 120\u2013132. Springer, Heidelberg (2006). doi:\n10.1007\/11779148_12"},{"key":"27_CR16","doi-asserted-by":"publisher","unstructured":"Filiot, E., Jecker, I., L\u00f6ding, C., Winter, S.: On equivalence and uniformisation problems for finite transducers. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. LIPIcs, vol. 55, p. 125:1\u2013125:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). doi:\n10.4230\/LIPIcs.ICALP.2016.125","DOI":"10.4230\/LIPIcs.ICALP.2016.125"},{"issue":"1","key":"27_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C Frougny","year":"1993","unstructured":"Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theor. Comput. Sci. 108(1), 45\u201382 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T Harju","year":"1991","unstructured":"Harju, T., Karhum\u00e4ki, J.: The equivalence problem of multitape finite automata. Theor. Comput. Sci. 78(2), 347\u2013355 (1991). doi:\n10.1016\/0304-3975(91)90356-7","journal-title":"Theor. Comput. Sci."},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367\u2013392. Springer, Heidelberg (1995). doi:\n10.1007\/3-540-60178-3_93"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/11690634_22","volume-title":"Foundations of Software Science and Computation Structures","author":"D Kuske","year":"2006","unstructured":"Kuske, D., Lohrey, M.: First-order and counting theories of \n            $$\\omega $$\n          -automatic structures. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FoSSaCS 2006. LNCS, vol. 3921, pp. 322\u2013336. Springer, Heidelberg (2006). doi:\n10.1007\/11690634_22"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-642-32589-2_66","volume-title":"Mathematical Foundations of Computer Science 2012","author":"C L\u00f6ding","year":"2012","unstructured":"L\u00f6ding, C., Repke, S.: Regularity problems for weak pushdown \n            $$\\omega $$\n          -automata and games. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 764\u2013776. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-32589-2_66"},{"issue":"3","key":"27_CR22","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(94)00014-5","volume":"61","author":"G P\u01ceun","year":"1995","unstructured":"P\u01ceun, G., Salomaa, A.: Thin and slender languages. Discret. Appl. Math. 61(3), 257\u2013270 (1995)","journal-title":"Discret. Appl. Math."},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: 21st Annual IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 255\u2013264. IEEE (2006)","DOI":"10.1109\/LICS.2006.28"},{"issue":"2","key":"27_CR24","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"27_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, New York (2009)"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11874683_6","volume-title":"Computer Science Logic","author":"J Srba","year":"2006","unstructured":"Srba, J.: Visibly pushdown automata: from language equivalence to simulation and bisimulation. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 89\u2013103. Springer, Heidelberg (2006). doi:\n10.1007\/11874683_6"},{"issue":"3","key":"27_CR27","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0019-9958(67)90591-8","volume":"11","author":"RE Stearns","year":"1967","unstructured":"Stearns, R.E.: A regularity test for pushdown machines. Inf. Control 11(3), 323\u2013340 (1967)","journal-title":"Inf. Control"},{"issue":"4","key":"27_CR28","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.ipl.2006.06.011","volume":"100","author":"Y Tao","year":"2006","unstructured":"Tao, Y.: Infinity problems and countability problems for \n            $$\\omega $$\n          -automata. Inf. Process. Lett. 100(4), 151\u2013153 (2006)","journal-title":"Inf. Process. Lett."},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B, pp. 133\u2013191 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"issue":"1","key":"27_CR30","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(92)90090-3","volume":"103","author":"W Thomas","year":"1992","unstructured":"Thomas, W.: Infinite trees and automation-definable relations over \n            $$\\omega $$\n          -words. Theor. Comput. Sci. 103(1), 143\u2013159 (1992). doi:\n10.1016\/0304-3975(92)90090-3","journal-title":"Theor. Comput. Sci."},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00596-1_1","volume-title":"Foundations of Software Science and Computational Structures","author":"W Thomas","year":"2009","unstructured":"Thomas, W.: Facets of synthesis: revisiting Church\u2019s problem. In: Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 1\u201314. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-00596-1_1"},{"issue":"1","key":"27_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321864.321865","volume":"22","author":"LG Valiant","year":"1975","unstructured":"Valiant, L.G.: Regularity and related problems for deterministic pushdown automata. J. ACM (JACM) 22(1), 1\u201310 (1975)","journal-title":"J. ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55751-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:40:18Z","timestamp":1502797218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55751-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662557501","9783662557518"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55751-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}