{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T15:24:58Z","timestamp":1769873098483,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","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]]},"DOI":"10.1016\/0304-3975(80)90052-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"317-333","source":"Crossref","is-referenced-by-count":7,"title":["Iteration theorems for families of strict deterministic languages"],"prefix":"10.1016","volume":"10","author":[{"given":"K.N.","family":"King","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90052-3_BIB1","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonetik Sprachwiss. Kommunikat"},{"key":"10.1016\/0304-3975(80)90052-3_BIB2","series-title":"Ph.D. Thesis","article-title":"Iteration theorems for the LL(k) languages","author":"Beatty","year":"1977"},{"key":"10.1016\/0304-3975(80)90052-3_BIB3","unstructured":"J.C. Beatty, Two iteration theorems for the LL(k) languages, submitted for publication."},{"key":"10.1016\/0304-3975(80)90052-3_BIB4","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0022-0000(73)80036-4","article-title":"Two iteration theorems for some families of languages","volume":"7","author":"Boasson","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(80)90052-3_BIB5","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(80)90052-3_BIB6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/0201024","article-title":"Real-time strict deterministic languages","volume":"1","author":"Harrison","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(80)90052-3_BIB7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","article-title":"Strict deterministic grammars","volume":"7","author":"Harrison","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(80)90052-3_BIB8","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1145\/321850.321851","article-title":"On the parsing of deterministic languages","volume":"21","author":"Harrison","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90052-3_BIB9","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/SWAT.1966.22","article-title":"Simple deterministic languages","author":"Korenjak","year":"1966","journal-title":"Conf. Rec. Seventh Ann. IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(80)90052-3_BIB10","series-title":"Ph.D. Thesis","article-title":"Intercalation theorems for pushdown store and stack languages","author":"Ogden","year":"1968"},{"key":"10.1016\/0304-3975(80)90052-3_BIB11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01694004","article-title":"A helpful result for proving inherent ambiguity","volume":"2","author":"Ogden","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(80)90052-3_BIB12","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","article-title":"Properties of deterministic top-down grammars","volume":"17","author":"Rosenkrantz","year":"1970","journal-title":"Information and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900523?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:20Z","timestamp":1555111460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980]]}},"alternative-id":["0304397580900523"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90052-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980]]}}}