{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:42:06Z","timestamp":1775054526543,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540074076","type":"print"},{"value":"9783540379232","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07407-4_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:56:42Z","timestamp":1330185402000},"page":"103-109","source":"Crossref","is-referenced-by-count":3,"title":["On the entropy of a formal language"],"prefix":"10.1007","author":[{"given":"A.","family":"Luca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0019-9958(63)90199-2","volume":"6","author":"R. B. Banerji","year":"1963","unstructured":"Banerji, R.B.-Phrase structure languages, finite machines and channel capacity.Information and Control,6,153\u2013162,1963.","journal-title":"Information and Control"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G. J. Chaitin","year":"1966","unstructured":"Chaitin, G.J.-On the length of programs for computing finite binary sequences.J.ACM,13,547\u2013569,1966.","journal-title":"J.ACM"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(58)90082-2","volume":"1","author":"N. Chomsky","year":"1958","unstructured":"Chomsky, N.and G.A. Miller,Finite state languages.Information and Control,1,91\u2013112,1958.","journal-title":"Information and Control"},{"key":"13_CR4","unstructured":"De Luca,A.,Complexity and information theory.Proc.of summer school on\"Coding and complexity.\"CISM,Udine,July 15\u201326,1974."},{"key":"13_CR5","unstructured":"De Luca,A.,Some information-theoretic aspects of the complexity theory,Proc.of the informal meeting on \"Computational complexity,codes and formal languages\".Laboratorio di Cibernetica,Naples,March 13\u201314, 1975."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"De Luca A.and E.Fischetti,Outline of a new logical approach to information theory.In \"New concepts and technologies in parallel information processing.\"(E.R.Caianiello ed.).Proc.of NATO summer school,Capri,June,17\u201330,1973.Noordhoff,Series E,n.9,1975.","DOI":"10.1007\/978-94-010-1917-0_26"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0019-9958(70)90533-4","volume":"17","author":"F. P. Kaminger","year":"1970","unstructured":"Kaminger, F.P.,The non computability of the channel capacity of context-sensitive languages\".Information and Control,17,175\u2013182,1970.","journal-title":"Information and Control"},{"key":"13_CR8","unstructured":"Khinchin,A.I.,\"Mathematical foundations of information theory\".Dover Publ.1950"},{"key":"13_CR9","first-page":"3","volume":"1","author":"A. N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.,Three approaches to the quantitative definition of information.Problemy Pederachi Informatsii,1,3\u201311,1965.","journal-title":"Problemy Pederachi Informatsii"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0019-9958(70)90105-1","volume":"16","author":"W. Kuich","year":"1970","unstructured":"Kuich, W.,On the entropy of context-free languages.Information and Control,16,173\u2013200,1970.","journal-title":"Information and Control"},{"key":"13_CR11","first-page":"85","volume":"25","author":"L. A. Levin","year":"1970","unstructured":"Levin, L.A.and A.K. Zvonkin,The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms,Usphehi Mat.Nauk,25,85\u2013127,1970","journal-title":"Usphehi Mat.Nauk"},{"key":"13_CR12","unstructured":"Mandelbrot,B.,On recurrent noise limiting coding,Proc.Symp.on Inf.Networks,Polytechn.Inst.of Brooklyn,205\u2013221,1954."},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"6","author":"P. Martin-Lof","year":"1966","unstructured":"Martin-Lof, P.,The definition of random sequences,Information and Control,6,602\u2013619,1966.","journal-title":"Information and Control"},{"key":"13_CR14","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.\"Formal languages\".Academic Press. New York and London,1973."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Schnorr,C.P.,\"Zufalligkeit und Wahrscheinlichkeit\".Springer Verlag Lecture Notes in Mathematics,n.218,1970.","DOI":"10.1007\/BFb0112458"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C. E. Shannon","year":"1948","unstructured":"Shannon, C.E.,A mathematical theory of communication,Bell Syst.Tech.J.27,379\u2013423,1948.","journal-title":"Bell Syst.Tech.J."},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0019-9958(69)90290-3","volume":"14","author":"R. Siromoney","year":"1969","unstructured":"Siromoney, R.,Channel capacity of equal matrix languages.Information and Control,14,507\u2013511,1969.","journal-title":"Information and Control"},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"l7","author":"R. J. Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.,A formal theory of inductive inference.Part 1,Information and Control,l7,1\u201322,1964.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20\u201323, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07407-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:31Z","timestamp":1605643051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07407-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074076","9783540379232"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-07407-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975]]}}}