{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:30:57Z","timestamp":1649021457457},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8963,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0304-3975(89)90068-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"91-111","source":"Crossref","is-referenced-by-count":1,"title":["A unified framework for disambiguating finite transductions"],"prefix":"10.1016","volume":"63","author":[{"given":"J.Howard","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90068-6_BIB1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(85)90170-7","article-title":"Transitive closure and related semiring properties via eliminants","volume":"40","author":"Abdali","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90068-6_BIB2","series-title":"Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(89)90068-6_BIB3","series-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/0304-3975(89)90068-6_BIB4","series-title":"The Theory of Parsing, Translation and Compiling, Vol. I: Parsing","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(89)90068-6_BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","article-title":"Regular algebra applied to path-finding problems","volume":"15","author":"Backhouse","year":"1975","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/0304-3975(89)90068-6_BIB6","series-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(89)90068-6_BIB7","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/S0022-0000(77)80033-0","article-title":"Single valued a-transducers","volume":"15","author":"Blattner","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(89)90068-6_BIB8","series-title":"Graphs and Networks","author":"Carr\u00e9","year":"1979"},{"key":"10.1016\/0304-3975(89)90068-6_BIB9","series-title":"Automata, Languages, and Machines, Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(89)90068-6_BIB10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","article-title":"On relations defined by generalized finite automata","volume":"9","author":"Elgot","year":"1965","journal-title":"IBM J. Res."},{"key":"10.1016\/0304-3975(89)90068-6_BIB11","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0304-3975(89)90068-6_BIB12","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(89)90068-6_BIB13","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(89)90068-6_BIB14","series-title":"Semirings, Automata, Languages","author":"Kuich","year":"1986"},{"issue":"1","key":"10.1016\/0304-3975(89)90068-6_BIB15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","article-title":"Algebraic structures for transitive closure","volume":"4","author":"Lehmann","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90068-6_BIB16","series-title":"Lex\u2014a Lexical Analyzer Generator","author":"Lesk","year":"1978"},{"key":"10.1016\/0304-3975(89)90068-6_BIB17","series-title":"Automata-Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/0304-3975(89)90068-6_BIB18","first-page":"209","article-title":"Sur les relations rationelles","author":"Sch\u00fctzenberger","year":"1975","journal-title":"Proc. 2nd GI Conf. on Automata Theory and Formal Languages"},{"key":"10.1016\/0304-3975(89)90068-6_BIB19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(77)90055-X","article-title":"Sur une variante des fonctions s\u00e9quentielles","volume":"4","author":"Sch\u00fctzenberger","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900686?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900686?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:56:08Z","timestamp":1555062968000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0304397589900686"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90068-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}