{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:59:08Z","timestamp":1743062348929,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030325046"},{"type":"electronic","value":"9783030325053"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32505-3_6","type":"book-chapter","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T23:30:14Z","timestamp":1572046214000},"page":"91-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Run Problem for Weighted Register Automata"],"prefix":"10.1007","author":[{"given":"Hiroyuki","family":"Seki","sequence":"first","affiliation":[]},{"given":"Reo","family":"Yoshimura","sequence":"additional","affiliation":[]},{"given":"Yoshiaki","family":"Takata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,22]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-98654-8_7","volume-title":"Developments in Language Theory","author":"S Almagor","year":"2018","unstructured":"Almagor, S., Cadilhac, M., Mazowiecki, F., P\u00e9rez, G.A.: Weak cost register automata are still powerful. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 83\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_7"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, 25\u201328 June 2013, pp. 13\u201322 (2013). https:\/\/doi.org\/10.1109\/LICS.2013.65","DOI":"10.1109\/LICS.2013.65"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"Hybrid Systems: Computation and Control","author":"R Alur","year":"2001","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49\u201362. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45351-2_8"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-319-46750-4_21","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2016","author":"P Babari","year":"2016","unstructured":"Babari, P., Droste, M., Perevoshchikov, V.: Weighted register automata and weighted logic on data words. In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 370\u2013384. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46750-4_21"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2018.01.004","volume":"744","author":"P Babari","year":"2018","unstructured":"Babari, P., Droste, M., Perevoshchikov, V.: Weighted register automata and weighted logic on data words. Theor. Comput. Sci. 744, 3\u201321 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.01.004","journal-title":"Theor. Comput. Sci."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J., Vaandrager, F.: Minimum-cost reachability for priced time automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147\u2013161. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45351-2_15"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Logical Methods Comput. Sci. 10(3) (2014). https:\/\/doi.org\/10.2168\/LMCS-10(3:4)2014","DOI":"10.2168\/LMCS-10(3:4)2014"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(02)00229-6","volume":"84","author":"P Bouyer","year":"2002","unstructured":"Bouyer, P.: A logical characterization of data languages. Inf. Process. Lett. 84(2), 75\u201385 (2002). https:\/\/doi.org\/10.1016\/S0020-0190(02)00229-6","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"EY Cheng","year":"1998","unstructured":"Cheng, E.Y., Kaminski, M.: Context-free languages over infinite alphabets. Acta Informatica 35(3), 245\u2013267 (1998). https:\/\/doi.org\/10.1007\/s002360050120","journal-title":"Acta Informatica"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/1507244.1507246","volume":"10","author":"S Demri","year":"2009","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3), 16:1\u201316:30 (2009). https:\/\/doi.org\/10.1145\/1507244.1507246","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoret. Comput. Sci. 134(2), 329\u2013363 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90242-9","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1016\/j.jcss.2015.03.005","volume":"81","author":"L Libkin","year":"2015","unstructured":"Libkin, L., Tan, T., Vrgo\u010d, D.: Regular expressions for data words. J. Comput. Syst. Sci. 81(7), 1278\u20131297 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2015.03.005","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Libkin, L., Vrgo\u010d, D.: Regular path queries on graphs with data. In: 15th International Conference on Database Theory (ICDT 2012), pp. 74\u201385 (2012). https:\/\/doi.org\/10.1145\/2274576.2274585","DOI":"10.1145\/2274576.2274585"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S0005-1098(98)00193-9","volume":"35","author":"J Lygeros","year":"1999","unstructured":"Lygeros, J., Tomlin, C., Sastry, S.: Controllers for reachability specifications for hybrid systems. Automatica 35(3), 349\u2013370 (1999). https:\/\/doi.org\/10.1016\/S0005-1098(98)00193-9","journal-title":"Automatica"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. In: 19th ACM Symposium on Principles of Database Systems (PODS 2000), pp. 11\u201322 (2000). https:\/\/doi.org\/10.1145\/335168.335171","DOI":"10.1145\/335168.335171"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3), 403\u2013435 (2004). https:\/\/doi.org\/10.1145\/1013560.1013562","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(99)00105-X","volume":"231","author":"H Sakamoto","year":"2000","unstructured":"Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231(2), 297\u2013308 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00105-X","journal-title":"Theor. Comput. Sci."},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-02508-3_22","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2018","author":"R Senda","year":"2018","unstructured":"Senda, R., Takata, Y., Seki, H.: Complexity results on register context-free grammars and register tree automata. In: Fischer, B., Uustalu, T. (eds.) ICTAC 2018. LNCS, vol. 11187, pp. 415\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02508-3_22"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-030-13435-8_19","volume-title":"Language and Automata Theory and Applications","author":"R Senda","year":"2019","unstructured":"Senda, R., Takata, Y., Seki, H.: Generalized register context-free grammars. In: Mart\u00edn-Vide, C., Okhotin, A., Shapira, D. (eds.) LATA 2019. LNCS, vol. 11417, pp. 259\u2013271. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-13435-8_19"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32505-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:56:50Z","timestamp":1710349010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-32505-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030325046","9783030325053"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32505-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hammamet","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tunisia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.redcad.org\/events\/ictac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}