{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:54:27Z","timestamp":1754556867716},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1974,6,1]],"date-time":"1974-06-01T00:00:00Z","timestamp":139276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1974,6]]},"DOI":"10.1007\/bf01762185","type":"journal-article","created":{"date-parts":[[2005,6,15]],"date-time":"2005-06-15T19:23:54Z","timestamp":1118863434000},"page":"150-155","source":"Crossref","is-referenced-by-count":5,"title":["Image theorems for simple matrix languages andn-parallel languages"],"prefix":"10.1007","volume":"8","author":[{"given":"Robert D.","family":"Rosebrugh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01762185_CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0019-9958(70)80034-1","volume":"17","author":"O. Ibarra","year":"1970","unstructured":"O. Ibarra, Simple matrix languages,Information and Control 17 (1970), 359\u2013394.","journal-title":"Information and Control"},{"key":"BF01762185_CR2","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0022-0000(73)80035-2","volume":"7","author":"R. D. Rosebrugh","year":"1973","unstructured":"R. D. Rosebrugh andD. Wood, A characterization theorem forn-parallel right linear languages,J. Computer System Sciences 7 (1973), 579\u2013582.","journal-title":"J. Computer System Sciences"},{"key":"BF01762185_CR3","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/S0022-0000(71)80015-6","volume":"5","author":"R. Siromoney","year":"1971","unstructured":"R. Siromoney, Finite turn checking automata,J. Computer System Sciences 5 (1971), 549\u2013559.","journal-title":"J. Computer System Sciences"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762185.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01762185\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T16:41:44Z","timestamp":1557333704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01762185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,6]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,6]]}},"alternative-id":["BF01762185"],"URL":"https:\/\/doi.org\/10.1007\/bf01762185","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,6]]}}}