{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:17:13Z","timestamp":1784182633774,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642403125","type":"print"},{"value":"9783642403132","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_22","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T14:36:43Z","timestamp":1376663803000},"page":"231-242","source":"Crossref","is-referenced-by-count":7,"title":["Semilinearity and Context-Freeness of Languages Accepted by Valence Automata"],"prefix":"10.1007","author":[{"given":"P.","family":"Buckheister","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5","key":"22_CR1","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1070\/RM2010v065n05ABEH004702","volume":"65","author":"S.I. Adian","year":"2010","unstructured":"Adian, S.I.: The Burnside problem and related topics. Russian Mathematical Surveys\u00a065(5), 805\u2013855 (2010)","journal-title":"Russian Mathematical Surveys"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N. Chomsky","year":"1963","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems, pp. 118\u2013161. North-Holland, Amsterdam (1963)"},{"issue":"1-2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G. Dirac","year":"1961","unstructured":"Dirac, G.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg\u00a025(1-2), 71\u201376 (1961)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Gilman, R.H.: Formal Languages and Infinite Groups. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a025, pp. 27\u201351. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/025\/03"},{"key":"22_CR5","unstructured":"Green, R.E.: Graph Products of Groups. Ph.D. thesis, University of Leeds (1990)"},{"issue":"3","key":"22_CR6","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. Theoretical Computer Science\u00a07(3), 311\u2013324 (1978)","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198511946.001.0001","volume-title":"Fundamentals of Semigroup Theory","author":"J.M. Howie","year":"1995","unstructured":"Howie, J.M.: Fundamentals of Semigroup Theory. Clarendon Press, Oxford (1995)"},{"key":"22_CR8","unstructured":"Jantzen, M.: Eigenschaften von Petrinetzsprachen. Ph.D. thesis, Universit\u00e4t Hamburg (1979)"},{"key":"22_CR9","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, 193\u2013208 (2009)","journal-title":"Communications in Algebra"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Kopczynski, E., To, A.: Parikh images of grammars: Complexity and applications. In: Proceedings of LICS 2010, pp. 80\u201389 (2010)","DOI":"10.1109\/LICS.2010.21"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"J.B. Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: A frequently discovered concept. Journal of Combinatorial Theory, Series A\u00a013(3), 297\u2013305 (1972)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"22_CR12","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":"22_CR13","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1080\/00927870601074855","volume":"35","author":"M. Lohrey","year":"2007","unstructured":"Lohrey, M., S\u00e9nizergues, G.: When is a graph product of groups virtually-free? Communications in Algebra\u00a035(2), 617\u2013621 (2007)","journal-title":"Communications in Algebra"},{"issue":"01","key":"22_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S021819670800438X","volume":"18","author":"M. Lohrey","year":"2008","unstructured":"Lohrey, M., S\u00e9nizergues, G.: Rational subsets in HNN-extensions and amalgamated products. Internat. J. Algebra Comput.\u00a018(01), 111\u2013163 (2008)","journal-title":"Internat. J. Algebra Comput."},{"issue":"2","key":"22_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"},{"key":"22_CR16","unstructured":"Render, E.: Rational Monoid and Semigroup Automata. Ph.D. thesis, University of Manchester (2010)"},{"issue":"1","key":"22_CR17","first-page":"17","volume":"16","author":"E.S. Wolk","year":"1965","unstructured":"Wolk, E.S.: A note on \u201dthe comparability graph of a tree\u201d. Proceedings of the American Mathematical Society\u00a016(1), 17\u201320 (1965)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-22012-8_17","volume-title":"Automata, Languages and Programming","author":"G. Zetzsche","year":"2011","unstructured":"Zetzsche, G.: On the capabilities of grammars, automata, and transducers controlled by monoids. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 222\u2013233. Springer, Heidelberg (2011)"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/978-3-642-39212-2_39","volume-title":"ICALP 2013","author":"G. Zetzsche","year":"2013","unstructured":"Zetzsche, G.: Silent transitions in automata with storage. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 434\u2013445. Springer, Heidelberg (2013), http:\/\/arxiv.org\/abs\/1302.3798"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T18:50:30Z","timestamp":1715885430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}