{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:00:07Z","timestamp":1768280407315,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1968,4,1]],"date-time":"1968-04-01T00:00:00Z","timestamp":-55296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":16544,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1968,4]]},"DOI":"10.1016\/s0019-9958(68)90374-4","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T06:51:40Z","timestamp":1103093500000},"page":"331-345","source":"Crossref","is-referenced-by-count":45,"title":["Algebra automata I: Parallel programming as a prolegomena to the categorical approach"],"prefix":"10.1016","volume":"12","author":[{"given":"M.A.","family":"Arbib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Give'on","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(68)90374-4_bib1","article-title":"Generalized Automata Theory with an Application to a Decision Problem of Second-Order Logic","author":"Thatcher","year":"1966","journal-title":"IBM Research RC 1713"},{"key":"10.1016\/S0019-9958(68)90374-4_bib2","article-title":"A Further Generalization of Finite Automata","author":"Thatcher","year":"1967","journal-title":"IBM Research RC 1846"},{"key":"10.1016\/S0019-9958(68)90374-4_bib3","article-title":"Generalized ALGOL-like languages","author":"Mezei","year":"1965","journal-title":"IBM Research Paper RC 1528"},{"key":"10.1016\/S0019-9958(68)90374-4_bib4","article-title":"Characterizing Derivation Trees of Context-Free Grammars through Generalized Finite Automata Theory","author":"Thatcher","year":"1967","journal-title":"IBM Research Note NC 719"},{"key":"10.1016\/S0019-9958(68)90374-4_bib5","article-title":"Mathematical Automata Theory","author":"B\\:uchi","year":"1960"},{"key":"10.1016\/S0019-9958(68)90374-4_bib6","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/S0019-9958(67)90670-5","article-title":"Automata in General Algebras","volume":"11","author":"Eilenberg","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/S0019-9958(68)90374-4_bib7","first-page":"869","article-title":"Functorial semantics of algebraic theories","volume":"50","author":"Lawvere","year":"1963"},{"key":"10.1016\/S0019-9958(68)90374-4_bib8","first-page":"433","article-title":"On the structure of abstract algebras","volume":"31","author":"Birkhoff","year":"1935"},{"key":"10.1016\/S0019-9958(68)90374-4_bib9","series-title":"Automata Studies","first-page":"3","article-title":"Representation of events in nerve nets and finite automata","author":"Kleene","year":"1956"},{"key":"10.1016\/S0019-9958(68)90374-4_bib10","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/IRETELC.1962.5407917","article-title":"A survey of regular expressions and their applications","volume":"EC-11","author":"Brzozowski","year":"1962","journal-title":"IRE Trans. Electron. Computers"},{"key":"10.1016\/S0019-9958(68)90374-4_bib11","series-title":"Universal Algebra","author":"Cohn","year":"1965"},{"key":"10.1016\/S0019-9958(68)90374-4_bib12","first-page":"541","article-title":"Linear automation transformations","volume":"9","author":"Nerode","year":"1958"},{"key":"10.1016\/S0019-9958(68)90374-4_bib13","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/S0019-9958(68)90374-4_bib14","article-title":"Tree Generating Systems and Tree Automata","author":"Brainerd","year":"1967"},{"key":"10.1016\/S0019-9958(68)90374-4_bib15","article-title":"Finite Automata and the Representation of Events","author":"Myhill","year":"1957","journal-title":"WADC Tech. Report 57-264"},{"key":"10.1016\/S0019-9958(68)90374-4_bib16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF01692498","article-title":"Categories of semimodules: The categorical structure properties of transition systems","volume":"1","author":"Give'on","year":"1967","journal-title":"Math. Systems Theory"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868903744?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868903744?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:52:40Z","timestamp":1548946360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995868903744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,4]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1968,4]]}},"alternative-id":["S0019995868903744"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(68)90374-4","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1968,4]]}}}