{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:36:16Z","timestamp":1648683376812},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1979,1]]},"DOI":"10.1016\/0096-0551(79)90002-x","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:11:16Z","timestamp":1060297876000},"page":"83-92","source":"Crossref","is-referenced-by-count":5,"title":["Inference for transition network grammars"],"prefix":"10.1016","volume":"4","author":[{"given":"S.M.","family":"Chou","sequence":"first","affiliation":[]},{"given":"K.S.","family":"Fu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(79)90002-X_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/361952.361958","article-title":"The use of grammatical inference for designing programming languages","author":"Crespi-Reghizzi","year":"1973","journal-title":"CACM"},{"key":"10.1016\/0096-0551(79)90002-X_BIB2","series-title":"Syntactic Methods in Pattern Recognition","author":"Fu","year":"1974"},{"key":"10.1016\/0096-0551(79)90002-X_BIB3","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0096-0551(79)90002-X_BIB4_1","first-page":"11","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/0096-0551(79)90002-X_BIB4_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/0096-0551(79)90002-X_BIB5","doi-asserted-by":"crossref","DOI":"10.21236\/AD0692390","article-title":"Grammatical Complexity and Inference","author":"Feldman","year":"1969"},{"issue":"No. 1","key":"10.1016\/0096-0551(79)90002-X_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1109\/TSMC.1975.5409159","article-title":"Grammatical inference: introduction and survey\u2014Part I","volume":"Vol. SMC-5","author":"Fu","year":"1975","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/0096-0551(79)90002-X_BIB7","series-title":"Machine Intelligence 3","first-page":"281","article-title":"The syntactic analysis of English by machine","author":"Thorne","year":"1968"},{"key":"10.1016\/0096-0551(79)90002-X_BIB8","series-title":"Proc. International Joint Conference on Artificial Intelligence","first-page":"577","article-title":"An augmented state transition network analysis procedure","author":"Bobrow","year":"1969"},{"key":"10.1016\/0096-0551(79)90002-X_BIB9","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/355598.362773","article-title":"Transition network grammars for natural language analysis","volume":"13","author":"Woods","year":"1970","journal-title":"CACM"},{"key":"10.1016\/0096-0551(79)90002-X_BIB10","article-title":"An Experimental Parsing System for Transition Network Grammars","author":"Woods","year":"1972"},{"key":"10.1016\/0096-0551(79)90002-X_BIB11","article-title":"Transition Networks for Pattern Recognition","author":"Chou","year":"1975"},{"key":"10.1016\/0096-0551(79)90002-X_BIB12","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","article-title":"Derivatives of regular expressions","volume":"11","author":"Brzozowski","year":"1964","journal-title":"J. ACM"},{"key":"10.1016\/0096-0551(79)90002-X_BIB13","series-title":"Stanford Artificial Intelligence Project Memo","article-title":"On the Synthesis of Finite-State Acceptors","author":"Biermann","year":"1970"},{"key":"10.1016\/0096-0551(79)90002-X_BIB14","series-title":"2nd International Joint Conference on Artificial Intelligence","first-page":"546","article-title":"Reduction of Enumeration in Grammar Acquisition","author":"Crespi-Reghizzi","year":"1971"},{"key":"10.1016\/0096-0551(79)90002-X_BIB15","first-page":"285","article-title":"A new method for discovering the grammars of phrase structure languages","author":"Solomonoff","year":"1959","journal-title":"Information Processing"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605517990002X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605517990002X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T09:20:39Z","timestamp":1552641639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009605517990002X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,1]]}},"alternative-id":["009605517990002X"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(79)90002-x","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1979,1]]}}}