{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:21Z","timestamp":1725738561625},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_7","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T09:09:19Z","timestamp":1372756159000},"page":"37-48","source":"Crossref","is-referenced-by-count":9,"title":["Decision\u00a0Problems\u00a0for\u00a0Additive\u00a0Regular\u00a0Functions"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Mukund","family":"Raghothaman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-31585-5_8","volume-title":"Automata, Languages, and Programming","author":"R. Alur","year":"2012","unstructured":"Alur, R., D\u2019Antoni, L.: Streaming tree transducers. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 42\u201353. Springer, Heidelberg (2012)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. To Appear in the 28th Annual Symposium on Logic in Computer Science (2013), Full version available at \n                    \n                      http:\/\/www.cis.upenn.edu\/~alur\/rca12.pdf","DOI":"10.1109\/LICS.2013.65"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: 26th Annual Symposium on Logic in Computer Science, pp. 355\u2013364 (2011)","DOI":"10.1109\/LICS.2011.48"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. Journal of the ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"Journal of the ACM"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative Languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"7_CR6","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Prentice Hall (2006)"},{"issue":"2","key":"7_CR7","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. Theoretical Computer Science\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundations of Computer Science, pp. 254\u2013266 (October 31-November 2, 1977)","DOI":"10.1109\/SFCS.1977.16"},{"key":"7_CR9","unstructured":"Markey, N.: Weighted automata: Model checking and games. Lecture Notes (2008), \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/~markey\/Teaching\/MPRI\/2008-2009\/MPRI-2.8b-4.pdf"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","volume":"234","author":"M. Mohri","year":"2000","unstructured":"Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science\u00a0234, 177\u2013201 (2000)","journal-title":"Theoretical Computer Science"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science, pp. 213\u2013254. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_6"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: Multiobjective query optimization. In: Proceedings of the 20th Symposium on Principles of Database Systems, PODS 2001, pp. 52\u201359. ACM (2001)","DOI":"10.1145\/375551.375560"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:38:22Z","timestamp":1557898702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}