{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:18:02Z","timestamp":1725596282218},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222559"},{"type":"electronic","value":"9783642222566"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22256-6_18","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T17:37:04Z","timestamp":1311010624000},"page":"190-202","source":"Crossref","is-referenced-by-count":0,"title":["On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B. Baker","year":"1974","unstructured":"Baker, B., Book, R.: Reversal-bounded multipushdown machines. J. Comput. Syst. Sci.\u00a08, 315\u2013322 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(86)90134-9","volume":"47","author":"K. Culik","year":"1986","unstructured":"Culik, K., Karhumaki, J.: The equivalence of finite valued transducers (on HDTOL languages) is decidable. Theoret. Comput. Sci.\u00a047, 71\u201384 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"T. Griffiths","year":"1968","unstructured":"Griffiths, T.: The unsolvability of the equivalence problem for \u039b-free nondeterministic generalized sequential machines. J. Assoc. Comput. Mach.\u00a015, 409\u2013413 (1968)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01744569","volume":"16","author":"E. Gurari","year":"1983","unstructured":"Gurari, E., Ibarra, O.H.: A note on finite-valued and finitely ambiguous transducers. Math. Systems Theory\u00a016, 61\u201366 (1983)","journal-title":"Math. Systems Theory"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach.\u00a025, 116\u2013133 (1978)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/0207042","volume":"7","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: The unsolvability of the equivalence problem for \u03b5-free NGSM\u2019s with unary input (output) alphabet and applications. SIAM J. Computing\u00a07, 524\u2013532 (1978)","journal-title":"SIAM J. Computing"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"Minsky, M.: Recursive unsolvability of Post\u2019s problem of Tag and other topics in the theory of Turing machines, Ann. of Math.\u00a074, 437\u2013455 (1961)","journal-title":"Ann. of Math."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/BF00264285","volume":"27","author":"A. Weber","year":"1990","unstructured":"Weber, A.: On the valuedness of finite transducers. Acta Inform.\u00a027, 749\u2013780 (1990)","journal-title":"Acta Inform."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/0222014","volume":"22","author":"A. Weber","year":"1993","unstructured":"Weber, A.: Decomposing finite-valued transducers and deciding their equivalence. SIAM. J. on Computing\u00a022, 175\u2013202 (1993)","journal-title":"SIAM. J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22256-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:09:40Z","timestamp":1553929780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22256-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222559","9783642222566"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22256-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}