{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:27:13Z","timestamp":1767911233109,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1971,10,1]],"date-time":"1971-10-01T00:00:00Z","timestamp":55123200000},"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":15266,"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":[[1971,10]]},"DOI":"10.1016\/s0019-9958(71)90075-1","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"195-203","source":"Crossref","is-referenced-by-count":10,"title":["The structure generating function and entropy of tuple languages"],"prefix":"10.1016","volume":"19","author":[{"given":"Werner","family":"Kuich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hermann","family":"Maurer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(71)90075-1_bib1","series-title":"IEEE Conference Record of Ninth Annual Symposium on Switching and Automata Theory","first-page":"278","article-title":"Regular-Like Expressions for Some Irregular Languages","author":"Brzozowski","year":"1968"},{"key":"10.1016\/S0019-9958(71)90075-1_bib2","series-title":"Computer Programming and Formal Systems","first-page":"118","article-title":"The algebraic theory of context-free languages","author":"Chomsky","year":"1963"},{"key":"10.1016\/S0019-9958(71)90075-1_bib3","series-title":"Vorlesungen \u00dcber Funktionentheorie","author":"Dinghas","year":"1961"},{"key":"10.1016\/S0019-9958(71)90075-1_bib4","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0019-9958(71)90075-1_bib5","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0022-0000(68)80009-1","article-title":"Derivation-bounded languages","volume":"2","author":"Ginsburg","year":"1968","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/S0019-9958(71)90075-1_bib6","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0019-9958(70)80034-1","article-title":"Simple matrix languages","volume":"17","author":"Ibarra","year":"1970","journal-title":"Information and Control"},{"key":"10.1016\/S0019-9958(71)90075-1_bib7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0019-9958(70)90105-1","article-title":"On the entropy of context-free languages","volume":"16","author":"Kuich","year":"1970","journal-title":"Information and Control"},{"key":"10.1016\/S0019-9958(71)90075-1_bib8","series-title":"Theoretische Grundlagen der Programmiersprachen-Syntax","author":"Maurer","year":"1969"},{"key":"10.1016\/S0019-9958(71)90075-1_bib9","series-title":"Proceedings of the ACM International Computing Symposium, 1970","first-page":"882","article-title":"Tuple Languages","author":"Maurer","year":"1970"},{"key":"10.1016\/S0019-9958(71)90075-1_bib10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/S0019-9958(71)90075-1_bib11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0019-9958(69)90050-3","article-title":"On equal matrix languages","volume":"14","author":"Siromoney","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/S0019-9958(71)90075-1_bib12","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0019-9958(69)90290-3","article-title":"Channel Capacity of Equal Matrix Languages","volume":"14","author":"Siromoney","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/S0019-9958(71)90075-1_bib13","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/S0019-9958(67)91032-7","article-title":"Inclusion relations among families of context-free languages","volume":"10","author":"Yntema","year":"1967","journal-title":"Information and Control"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995871900751?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995871900751?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:50:19Z","timestamp":1548946219000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995871900751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,10]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1971,10]]}},"alternative-id":["S0019995871900751"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(71)90075-1","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1971,10]]}}}