{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:07:06Z","timestamp":1725466026645},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637462"},{"type":"electronic","value":"9783540696407"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0052082","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:02:10Z","timestamp":1149642130000},"page":"135-142","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On twist-closed trios: A new morphic characterization of r.e. sets"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Jantzen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,16]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B.S. Baker","year":"1974","unstructured":"B.S. Baker and R.V. Book. Reversal-bounded multipushdown machines, J.Comput. Syst. Sci., 8 (1974) 315\u2013332.","journal-title":"J.Comput. Syst. Sci."},{"volume-title":"Transductions and Context-free Languages","year":"1980","author":"J. Berstel","key":"11_CR2","unstructured":"J. Berstel, Transductions and Context-free Languages, Teubner Stuttgart (1980)."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01705890","volume":"19","author":"R.V. Book","year":"1970","unstructured":"R.V. Book and S. Greibach. Quasi-realtime languages, Math. Syst. Theory 19 (1970) 97\u2013111.","journal-title":"Math. Syst. Theory"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1051\/ita\/1978120403691","volume":"19","author":"R.V. Book","year":"1978","unstructured":"R.V. Book and S. Greibach. The independence of certain operations on semiAFLs, RAIRO Informatique Th\u00e9orique, 19 (1978) 369\u2013385.","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(79)90004-7","volume":"19","author":"R.V. Book","year":"1979","unstructured":"R.V. Book, S. Greibach, C. Wrathall. Reset machines, J. Comput. Syst. Sci., 19 (1979) 256\u2013276.","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1137\/0203023","volume":"3","author":"R.V. Book","year":"1974","unstructured":"R.V. Book, M. Nivat, and M. Paterson. Reversal-bounded acceptors and intersections of linear languages, Siam J. on Computing, 3 (1974) 283\u2013295.","journal-title":"Siam J. on Computing"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(87)90103-4","volume":"55","author":"F.J. Brandenburg","year":"1987","unstructured":"F.J. Brandenburg. Representations of language families by homomorphic equality operations and generalized equality sets, Theoretical Computer Science, 55 (1987) 183\u2013263.","journal-title":"Theoretical Computer Science"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(88)90019-9","volume":"58","author":"F.J. Brandenburg","year":"1988","unstructured":"F.J. Brandenburg. On the intersection of stacks and queues, Theoretical Computer Science, 58 (1988) 69\u201380.","journal-title":"Theoretical Computer Science"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/322123.322136","volume":"26","author":"K. Culik","year":"1979","unstructured":"K. Culik. A purely homomorphic characterization of recursively enumerable sets, J. ACM 26 (1979) 345\u2013350.","journal-title":"J. ACM"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/S0019-9958(79)90082-2","volume":"43","author":"J. Engelfriet","year":"1979","unstructured":"J. Engelfriet and G. Rozenberg. Equality languages and fixed point languages, Information and Control, 43 (1979) 20\u201349.","journal-title":"Information and Control"},{"key":"11_CR11","first-page":"144","volume":"60","author":"J. Engelfriet","year":"1996","unstructured":"J. Engelfriet. Reverse twin shuffles, Bulletin of the EATCS, vol. 60 (1996) 144.","journal-title":"Bulletin of the EATCS"},{"volume-title":"Algebraic and Automata Theoretic Properties of Formal Languages","year":"1975","author":"S. Ginsburg","key":"11_CR12","unstructured":"S. Ginsburg, Algebraic and Automata Theoretic Properties of Formal Languages, North Holland Publ. Comp. Amsterdam (1975)."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0019-9958(73)90274-X","volume":"22","author":"S. Ginsburg","year":"1973","unstructured":"S. Ginsburg and J. Goldstein. Intersection-closed full AFL and the recursively enumerable languages, Information and Control, 22 (1973) 201\u2013231.","journal-title":"Information and Control"},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(70)80016-2","volume":"4","author":"S. Ginsburg","year":"1970","unstructured":"S. Ginsburg and S. Greibach, Principal AFL, J. Comput. Syst. Sci., 4 (1970) 308\u2013338.","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S. Greibach","year":"1978","unstructured":"S. Greibach. Remarks on blind and partially blind one-way multicounter machines, Theoretical Computer Science, 7 (1978) 311\u2013236.","journal-title":"Theoretical Computer Science"},{"key":"11_CR16","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publ. Comp. (1997)."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1979130100191","volume":"13","author":"M. Jantzen","year":"1979","unstructured":"M. Jantzen.On the hierarchy of Petri net languages, R.A.I.R.O., Informatique Th\u00e9orique, 13 (1979) 19\u201330.","journal-title":"Informatique Th\u00e9orique"},{"key":"11_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-642-72822-8_17","volume-title":"Concurrency and Nets","author":"M. Jantzen","year":"1987","unstructured":"M. Jantzen and H. Petersen. Petri net languages and one-sided reductions of context-free sets, in: (K Voss, H. Genrich, and G. Rozenberg, eds.) Concurrency and Nets, Springer, Berlin, Heidelberg, New York (1987) 245\u2013252."},{"key":"11_CR19","unstructured":"M. Jantzen and H. Petersen. Twisting Petri net languages and how to obtain them by reducing linear context-free sets, in: Proc. 12th Internat. Conf. on Petri Nets, Gjern (1991) 228\u2013236."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(94)90104-X","volume":"127","author":"M. Jantzen","year":"1994","unstructured":"M. Jantzen and H. Petersen. Cancellation in context-free languages: enrichment by reduction. Theoretical Computer Science, 127 (1994) 149\u2013170.","journal-title":"Theoretical Computer Science"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"S.R. Kosaraju. Decidability of reachability of vector addition systems, 14th Annual ACM Symp. on Theory of Computing, San Francisco, (1982) 267\u2013281.","DOI":"10.1145\/800070.802201"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"E.W. Mayr. An algorithm for the general Petri net reachability problem,SIAM J. of Computing, 13 (1984) 441\u2013459.","journal-title":"SIAM J. of Computing"},{"key":"11_CR23","first-page":"127","volume":"4","author":"A. Salomaa","year":"1978","unstructured":"A. Salomaa. Equality sets for homomorphisms and free monoids, Acta Cybernetica 4 (1978) 127\u2013139.","journal-title":"Acta Cybernetica"},{"volume-title":"Jewels of formal Language Theory","year":"1981","author":"A. Salomaa","key":"11_CR24","unstructured":"A. Salomaa. Jewels of formal Language Theory, Computer Science Press, Rockville (1981)."}],"container-title":["Lecture Notes in Computer Science","Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T18:18:14Z","timestamp":1676657894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0052082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637462","9783540696407"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0052082","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"16 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}