{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:19:25Z","timestamp":1767903565203,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"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":12251,"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":[[1980,1]]},"DOI":"10.1016\/0304-3975(80)90069-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"19-35","source":"Crossref","is-referenced-by-count":123,"title":["On equations for regular languages, finite automata, and sequential networks"],"prefix":"10.1016","volume":"10","author":[{"given":"J.A.","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Leiss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90069-9_BIB1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/FOCS.1961.13","article-title":"Delayed logic and finite state machines","author":"Arden","year":"1961","journal-title":"Proc. 2nd Ann. Symp. on Switching Circuit Theory and Logical Design"},{"key":"10.1016\/0304-3975(80)90069-9_BIB2","first-page":"1077","article-title":"Sistemy uravnenij v algebre sobytij","volume":"3","author":"Bodnarchuk","year":"1963","journal-title":"Z. Vy\u010disl. Mat. i Fiz."},{"key":"10.1016\/0304-3975(80)90069-9_BIB3","series-title":"Mathematical Theory of Automata","first-page":"529","article-title":"Canonical regular expressions and minimal state graphs for definite events","author":"Brzozowski","year":"1963"},{"issue":"6","key":"10.1016\/0304-3975(80)90069-9_BIB4","first-page":"741","article-title":"Regular expressions from sequential circuits","volume":"EC-13","author":"Brzozowski","year":"1964","journal-title":"IEEE Trans."},{"key":"10.1016\/0304-3975(80)90069-9_BIB5","series-title":"Digital Networks","author":"Brzozowski","year":"1976"},{"key":"10.1016\/0304-3975(80)90069-9_BIB6","series-title":"Proc. 17th Ann. Symp. on Foundations of Computer Science","first-page":"89","article-title":"On Parallelism in Turing machines","author":"Kozen","year":"1976"},{"key":"10.1016\/0304-3975(80)90069-9_BIB7","series-title":"Theory of Automata","author":"Salomaa","year":"1969"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900699?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900699?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:24:09Z","timestamp":1555111449000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,1]]}},"alternative-id":["0304397580900699"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90069-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,1]]}}}