{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T15:13:34Z","timestamp":1770909214254,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,2,1]],"date-time":"1978-02-01T00:00:00Z","timestamp":255139200000},"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":12950,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1978,2]]},"DOI":"10.1016\/0022-0000(78)90049-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"37-55","source":"Crossref","is-referenced-by-count":104,"title":["The dot-depth hierarchy of star-free languages is infinite"],"prefix":"10.1016","volume":"16","author":[{"given":"J.A.","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Knast","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(78)90049-1_BIB1","first-page":"35","article-title":"Hierarchies of aperiodic languages","volume":"10","author":"Brzozowsm","year":"1976","journal-title":"Rev. Fran\u00e7aise d'Automatique Informat. Recherche Operationnelle S\u00e9rie Rouge (Informatique Th\u00e9orique)"},{"key":"10.1016\/0022-0000(78)90049-1_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0022-0000(71)80006-5","article-title":"Classification of noncounting events","volume":"5","author":"Brzozowski","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(78)90049-1_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(71)80003-X","article-title":"Dot-depth of star-free events","volume":"5","author":"Cohen","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(78)90049-1_BIB4","series-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/0022-0000(78)90049-1_BIB5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","article-title":"On finite monoids having only trivial subgroups","volume":"8","author":"Schutzenberger","year":"1965","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(78)90049-1_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-07407-4_23","article-title":"Piecewise testable events","author":"Simon","year":"1975"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900491?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900491?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:27:50Z","timestamp":1550305670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000078900491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,2]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,2]]}},"alternative-id":["0022000078900491"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(78)90049-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1978,2]]}}}