{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:11:43Z","timestamp":1775873503245,"version":"3.50.1"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1972,6,1]],"date-time":"1972-06-01T00:00:00Z","timestamp":76204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1972,6]]},"DOI":"10.1109\/tc.1972.5009015","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T16:36:47Z","timestamp":1243960607000},"page":"592-597","source":"Crossref","is-referenced-by-count":369,"title":["On the Synthesis of Finite-State Machines from Samples of Their Behavior"],"prefix":"10.1109","volume":"C-21","author":[{"given":"A. W.","family":"Biermann","sequence":"first","affiliation":[]},{"given":"J. A.","family":"Feldman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"ginsburg","year":"1966","journal-title":"The Mathematical Theory of Context-Free Languages"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(66)80011-6"},{"key":"ref12","author":"harrison","year":"1965","journal-title":"Introduction to Switching and Automata Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0016-0032(54)90618-3"},{"key":"ref14","first-page":"275","year":"1954"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1955.tb03788.x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2307\/2033204"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/321088.321097"},{"key":"ref18","first-page":"946","article-title":"questionnaire language and the abstract synthesis of minimal sequential machines","volume":"25","author":"tal","year":"1964","journal-title":"Avtomat Telemekh"},{"key":"ref4","author":"feldman","year":"1970","journal-title":"Some decidability results on grammatical inference and complexity"},{"key":"ref3","author":"feldman","year":"1967","journal-title":"First thoughts on grammatical inference"},{"key":"ref6","author":"gill","year":"1962","journal-title":"Introduction to the Theory of Finite-State Machines"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.21236\/AD0692390","author":"feldman","year":"1969","journal-title":"Grammatical complexity and inference"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1959.5222056"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/321312.321316"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/321239.321249"},{"key":"ref1","article-title":"a survey of results in grammatical inference","author":"biermann","year":"1971","journal-title":"Int Conf Frontiers of Pattern Recognition"},{"key":"ref9","author":"ginsburg","year":"1962","journal-title":"An Introduction to Mathematical Machine Theory"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/5009001\/05009015.pdf?arnumber=5009015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:39:19Z","timestamp":1638200359000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5009015\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,6]]},"references-count":18,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tc.1972.5009015","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1972,6]]}}}