{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:34:17Z","timestamp":1783150457101,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642392115","type":"print"},{"value":"9783642392122","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_39","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T09:09:19Z","timestamp":1372756159000},"page":"434-445","source":"Crossref","is-referenced-by-count":9,"title":["Silent Transitions in Automata with Storage"],"prefix":"10.1007","author":[{"given":"Georg","family":"Zetzsche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-Rewriting Systems","author":"R.V. Book","year":"1993","unstructured":"Book, R.V., Otto, F.: String-Rewriting Systems. Springer, New York (1993)"},{"key":"39_CR2","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.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"issue":"1","key":"39_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(01)00089-5","volume":"290","author":"D. Caucal","year":"2003","unstructured":"Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci.\u00a0290(1), 79\u2013115 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"39_CR4","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1142\/S0218196708004901","volume":"18","author":"M. Elder","year":"2008","unstructured":"Elder, M., Kambites, M., Ostheimer, G.: On Groups and Counter Automata. Internat. J. Algebra Comput.\u00a018(8), 1345\u20131364 (2008)","journal-title":"Internat. J. Algebra Comput."},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Gilman, R.H.: Formal Languages and Infinite Groups. In: Geometric and Computational Perspectives on Infinite Groups. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a025 (1996)","DOI":"10.1090\/dimacs\/025\/03"},{"issue":"2","key":"39_CR6","first-page":"333","volume":"113","author":"S. Ginsburg","year":"1964","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded Algol-Like Languages. Trans. Amer. Math. Soc.\u00a0113(2), 333\u2013368 (1964)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"2","key":"39_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I. Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inf. Process. Lett.\u00a059(2), 75\u201377 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"39_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S.A. Greibach","year":"1978","unstructured":"Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci.\u00a07(3), 311\u2013324 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"39_CR9","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. J. ACM\u00a027(4), 797\u2013821 (1980)","journal-title":"J. ACM"},{"issue":"3","key":"39_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0304-3975(76)90081-5","volume":"2","author":"O.H. Ibarra","year":"1976","unstructured":"Ibarra, O.H., Sahni, S.K., Kim, C.E.: Finite automata with multiplication. Theor. Comput. Sci.\u00a02(3), 271\u2013294 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR11","unstructured":"Jantzen, M.: Eigenschaften von Petrinetzsprachen. German. PhD thesis. Universit\u00e4t Hamburg (1979)"},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/00927870802243580","volume":"37","author":"M. Kambites","year":"2009","unstructured":"Kambites, M.: Formal Languages and Groups as Memory. Communications in Algebra\u00a037(1), 193\u2013208 (2009)","journal-title":"Communications in Algebra"},{"key":"39_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11505877_27","volume-title":"Developments in Language Theory","author":"W. Karianto","year":"2005","unstructured":"Karianto, W.: Adding Monotonic Counters to Automata and Transition Graphs. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 308\u2013319. Springer, Heidelberg (2005)"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-06841-4_49","volume-title":"Automata, Languages and Programming","author":"J. Leeuwen van","year":"1974","unstructured":"van Leeuwen, J.: A generalisation of Parikh\u2019s theorem in formal language theory. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol.\u00a014, pp. 17\u201326. Springer, Heidelberg (1974)"},{"issue":"2","key":"39_CR15","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.jalgebra.2007.08.025","volume":"320","author":"M. Lohrey","year":"2008","unstructured":"Lohrey, M., Steinberg, B.: The submonoid and rational subset membership problems for graph groups. J. Algebra\u00a0320(2), 728\u2013755 (2008)","journal-title":"J. Algebra"},{"issue":"3","key":"39_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0166-218X(00)00200-6","volume":"108","author":"V. Mitrana","year":"2001","unstructured":"Mitrana, V., Stiebe, R.: Extended finite automata over groups. Discrete Applied Mathematics\u00a0108(3), 287\u2013300 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"11","key":"39_CR17","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1016\/j.ic.2009.02.012","volume":"207","author":"E. Render","year":"2009","unstructured":"Render, E., Kambites, M.: Rational subsets of polycyclic monoids and valence automata. Inform. and Comput.\u00a0207(11), 1329\u20131339 (2009)","journal-title":"Inform. and Comput."}],"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_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:13:20Z","timestamp":1557897200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}