{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:23Z","timestamp":1725663203024},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_98","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:59:41Z","timestamp":1330203581000},"page":"523-533","source":"Crossref","is-referenced-by-count":4,"title":["On the lengths of values in a finite transducer"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Weber","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979."},{"key":"46_CR2","first-page":"310","volume":"15","author":"M. Blattner","year":"1977","unstructured":"M. Blattner and T. Head, Single-valued a-transducers, JCSS, 15(1977), pp. 310\u2013327.","journal-title":"JCSS"},{"key":"46_CR3","series-title":"LNCS","first-page":"162","volume-title":"New techniques for proving the decidability of equivalence problems","author":"K. Culik II","year":"1988","unstructured":"K. Culik II, New techniques for proving the decidability of equivalence problems, Proc. 15th ICALP, in: LNCS, No. 317, Springer-Verlag, Berlin, Heidelberg, 1988, pp. 162\u2013175."},{"key":"46_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(86)90134-9","volume":"47","author":"K. Culik II","year":"1986","unstructured":"K. Culik II and J. Karhum\u00e4ki, The equivalence of finite valued transducers (on HDTOL languages) is decidable, TCS, 47(1986), pp. 71\u201384.","journal-title":"TCS"},{"key":"46_CR5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"T. Griffiths","year":"1968","unstructured":"T. Griffiths, The unsolvability of the equivalence problem for \u2227-free nondeterministic generalized machines, JACM, 15(1968), pp. 409\u2013413.","journal-title":"JACM"},{"key":"46_CR6","first-page":"220","volume":"22","author":"E. Gurari","year":"1981","unstructured":"E. Gurari and O. Ibarra, The complexity of decision problems for finite-turn multi-counter machines, JCSS, 22(1981), pp. 220\u2013229.","journal-title":"JCSS"},{"key":"46_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01744569","volume":"16","author":"E. Gurari","year":"1983","unstructured":"E. Gurari and O. Ibarra, A note on finite-valued and finitely ambiguous transducers, Math. Systems Theory, 16(1983), pp. 61\u201366.","journal-title":"Math. Systems Theory"},{"volume-title":"Introduction to Automata Theory, Languages and Computation","year":"1979","author":"J. Hopcroft","key":"46_CR8","unstructured":"J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979."},{"key":"46_CR9","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0207042","volume":"7","author":"O. Ibarra","year":"1978","unstructured":"O. Ibarra, The unsolvability of the equivalence problem for \u03b5-free NGSM's with unary input (output) alphabet and applications, SIAM J. Comput., 7(1978), pp. 524\u2013532.","journal-title":"SIAM J. Comput."},{"key":"46_CR10","series-title":"LNCS","first-page":"26","volume-title":"The equivalence of mappings on languages","author":"J. Karhum\u00e4ki","year":"1987","unstructured":"J. Karhum\u00e4ki, The equivalence of mappings on languages, Proc. 4th IMYCS, in: LNCS, No. 281, Springer-Verlag, Berlin, Heidelberg, 1987, pp. 26\u201338."},{"key":"46_CR11","series-title":"LNCS","first-page":"136","volume-title":"On recent trends in formal language theory","author":"J. Karhum\u00e4ki","year":"1987","unstructured":"J. Karhum\u00e4ki, On recent trends in formal language theory, Proc. 14th ICALP, in: LNCS, No. 267, Springer-Verlag, Berlin, Heidelberg, 1987, pp. 136\u2013162."},{"key":"46_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(76)90026-8","volume":"3","author":"M. Sch\u00fctzenberger","year":"1976","unstructured":"M. Sch\u00fctzenberger, Sur les relations rationnelles entre mono\u00efdes libres, TCS, 3(1976), pp. 243\u2013259.","journal-title":"TCS"},{"key":"46_CR13","unstructured":"A. Weber, \u00dcber die Mehrdeutigkeit und Wertigkeit von endlichen Automaten und Transducern, Dissertation, Goethe-Universit\u00e4t Frankfurt am Main, 1987."},{"key":"46_CR14","series-title":"LNCS","first-page":"552","volume-title":"A decomposition theorem for finite-valued transducers and an application to the equivalence problem","author":"A. Weber","year":"1988","unstructured":"A. Weber, A decomposition theorem for finite-valued transducers and an application to the equivalence problem, Proc. MFCS 1988, in: LNCS, No. 324, Springer-Verlag, Berlin, Heidelberg, 1988, pp. 552\u2013562."},{"key":"46_CR15","unstructured":"A. Weber, On the valuedness of finite transducers, Preprint, Goethe-Universit\u00e4t Frankfurt am Main, 1988."},{"key":"46_CR16","unstructured":"A. Weber, A decomposition theorem for finite-valued transducers and an application to the equivalence problem, Preprint, Goethe-Universit\u00e4t Frankfurt am Main, 1988."},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"A. Weber, On the lengths of values in a finite transducer, Preprint, Goethe-Universit\u00e4t Frankfurt am Main, 1989.","DOI":"10.1007\/3-540-51486-4_98"},{"key":"46_CR18","series-title":"LNCS","first-page":"620","volume-title":"On the degree of ambiguity of finite automata","author":"A. Weber","year":"1986","unstructured":"A. Weber and H. Seidel, On the degree of ambiguity of finite automata, Proc. MFCS 1986, in: LNCS, No. 233, Springer-Verlag, Berlin, Heidelberg, 1986, pp. 620\u2013629."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:54:50Z","timestamp":1640919290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}