{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:01:05Z","timestamp":1752192065650,"version":"3.41.2"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[1979,8,1]],"date-time":"1979-08-01T00:00:00Z","timestamp":302313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1979,8,1]],"date-time":"1979-08-01T00:00:00Z","timestamp":302313600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1979,8,1]],"date-time":"1979-08-01T00:00:00Z","timestamp":302313600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1979,8]]},"DOI":"10.1109\/tc.1979.1675417","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"582-586","source":"Crossref","is-referenced-by-count":2,"title":["An Application-Oriented Programming Language for Sequential Machine Studies"],"prefix":"10.1109","volume":"C-28","author":[{"family":"Feldman","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, George Washington University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/15.3.222"},{"journal-title":"Algebraic Theory of Automata","year":"1968","author":"ginzburg","key":"ref10"},{"journal-title":"M-460 program notes Some LISP routines for manipulating automata","year":"1966","author":"griffiths","key":"ref11"},{"journal-title":"The SNOBOL4 Programming Language","year":"1971","author":"griswold","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/364175.364185"},{"journal-title":"On the reduction of nondeterministic automata","year":"1968","author":"kameda","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.222994"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/321420.321421"},{"journal-title":"Compiler Design Theory","year":"1976","author":"lewis","key":"ref18"},{"key":"ref19","first-page":"75","article-title":"an algol compiler designed using automata theory","author":"lewis","year":"1971","journal-title":"Proc Symp Comput and Automata"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5008956"},{"journal-title":"SPITBOL","year":"1971","author":"dewar","key":"ref4"},{"year":"0","key":"ref27"},{"key":"ref3","first-page":"105","article-title":"on the definition of higher-level-language machines","author":"bj\ufffdrner","year":"1971","journal-title":"Proc Symp on Computers and Automata"},{"journal-title":"AUTOMAT A programming system for the study of transition-table automata models","year":"1973","author":"feldman","key":"ref6"},{"journal-title":"Programming Languages History and Fundamentals","year":"1969","author":"sammet","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/321172.321183"},{"key":"ref8","first-page":"120","article-title":"using apl to investigate sequential machines","author":"foster","year":"0","journal-title":"NEREM 70 Tech Appl Papers"},{"key":"ref7","first-page":"237","article-title":"new languages from old: the extension of programming languages by embedding, with a case study","author":"feldman","year":"1976","journal-title":"1976 Proc 2nd Annu Conf on Software Eng"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5009015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1967.3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/356608.356610"},{"journal-title":"Counter-Free Automata","year":"1971","author":"mcnaughton","key":"ref20"},{"year":"0","key":"ref22"},{"journal-title":"Programs for the analysis of sequential machines","year":"1969","author":"miller","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/872740.807096"},{"journal-title":"Mechanical translation of regular expressions","year":"1972","author":"nicholson","key":"ref23"},{"journal-title":"Computer Programs Dealing with Finite-State Machines Parts I and II","year":"1967","author":"piatkowski","key":"ref26"},{"journal-title":"A solution of the syntactical induction-inference problem for a non-trivial subset of context-free languages","year":"1969","author":"pao","key":"ref25"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35184\/01675417.pdf?arnumber=1675417","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:08:48Z","timestamp":1752102528000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1675417\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,8]]},"references-count":30,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tc.1979.1675417","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[1979,8]]}}}