{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:10:52Z","timestamp":1748405452662,"version":"3.41.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031896095","type":"print"},{"value":"9783031896101","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-89610-1_13","type":"book-chapter","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:41:45Z","timestamp":1748335305000},"page":"176-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equivalence of Deterministic Weighted Real-Time One-Counter Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6410-1474","authenticated-orcid":false,"given":"Prince","family":"Mathew","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Penelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Saivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. V.","family":"Sreejith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,26]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, S., G\u00f6ller, S.: Language equivalence of deterministic real-time one-counter automata is NL-complete. In: Murlak, F., Sankowski, P. (eds.) MFCS. Lecture Notes in Computer Science, vol. 6907, pp. 194\u2013205. Springer (2011)","DOI":"10.1007\/978-3-642-22993-0_20"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, S., G\u00f6ller, S., Jan\u010dar, P.: Bisimilarity of one-counter processes is PSPACEComplete. In: Gastin, P., Laroussinie, F. (eds.) CONCUR. Lecture Notes in Computer Science, vol. 6269, pp. 177\u2013191. Springer (2010)","DOI":"10.1007\/978-3-642-15375-4_13"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"B\u00f6hm, S., G\u00f6ller, S., Jancar, P.: Equivalence of deterministic one-counter automata is NL-complete. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1\u20134 June 2013, pp. 131\u2013140. ACM (2013). https:\/\/doi.org\/10.1145\/2488608.2488626","DOI":"10.1145\/2488608.2488626"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1016\/j.jcss.2013.11.003","volume":"80","author":"S B\u00f6hm","year":"2014","unstructured":"B\u00f6hm, S., G\u00f6ller, S., Jancar, P.: Bisimulation equivalence and regularity for real-time one-counter automata. J. Comput. Syst. Sci. 80(4), 720\u2013743 (2014)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2014.04.003","volume":"237","author":"V Forejt","year":"2014","unstructured":"Forejt, V., Jancar, P., Kiefer, S., Worrell, J.: Language equivalence of probabilistic pushdown automata. Inf. Comput. 237, 1\u201311 (2014)","journal-title":"Inf. Comput."},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: On the complexity of equivalence and minimisation for q-weighted automata. Log. Methods Comput. Sci. 9(1) (2013). https:\/\/doi.org\/10.2168\/LMCS-9(1:8)2013","DOI":"10.2168\/LMCS-9(1:8)2013"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Mathew, P., Penelle, V., Saivasan, P., Sreejith, A.: Weighted one-deterministic-counter automata. In: Bouyer, P., Srinivasan, S. (eds.) 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0284, pp. 39:1\u201339:23. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2023). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2023.39, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.FSTTCS.2023.39","DOI":"10.4230\/LIPIcs.FSTTCS.2023.39"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"S\u00e9nizergues, G.: The equivalence problem for deterministic pushdown automata is decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) Automata, Languages and Programming, pp. 671\u2013681. Springer, Heidelberg (1997)","DOI":"10.1007\/3-540-63165-8_221"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Stirling: Deciding DPDA equivalence is primitive recursive. In: ICALP: Annual International Colloquium on Automata, Languages and Programming (2002)","DOI":"10.1007\/3-540-45465-9_70"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Valiant, Paterson: Deterministic one-counter automata. JCSS: J. Comput. Syst. Sci. 10 (1975)","DOI":"10.1016\/S0022-0000(75)80005-5"}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-89610-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:41:50Z","timestamp":1748335310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-89610-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031896095","9783031896101"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-89610-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"26 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indian Conference on Logic and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icla2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logicindia.org\/icla\/icla2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}