Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Banerji, R.B.-Phrase structure languages, finite machines and channel capacity.Information and Control,6,153–162,1963.
Chaitin, G.J.-On the length of programs for computing finite binary sequences.J.ACM,13,547–569,1966.
Chomsky, N.and G.A. Miller,Finite state languages.Information and Control,1,91–112,1958.
De Luca,A.,Complexity and information theory.Proc.of summer school on"Coding and complexity."CISM,Udine,July 15–26,1974.
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–14, 1975.
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–30,1973.Noordhoff,Series E,n.9,1975.
Kaminger, F.P.,The non computability of the channel capacity of context-sensitive languages".Information and Control,17,175–182,1970.
Khinchin,A.I.,"Mathematical foundations of information theory".Dover Publ.1950
Kolmogorov, A.N.,Three approaches to the quantitative definition of information.Problemy Pederachi Informatsii,1,3–11,1965.
Kuich, W.,On the entropy of context-free languages.Information and Control,16,173–200,1970.
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–127,1970
Mandelbrot,B.,On recurrent noise limiting coding,Proc.Symp.on Inf.Networks,Polytechn.Inst.of Brooklyn,205–221,1954.
Martin-Lof, P.,The definition of random sequences,Information and Control,6,602–619,1966.
Salomaa, A."Formal languages".Academic Press. New York and London,1973.
Schnorr,C.P.,"Zufalligkeit und Wahrscheinlichkeit".Springer Verlag Lecture Notes in Mathematics,n.218,1970.
Shannon, C.E.,A mathematical theory of communication,Bell Syst.Tech.J.27,379–423,1948.
Siromoney, R.,Channel capacity of equal matrix languages.Information and Control,14,507–511,1969.
Solomonoff, R.J.,A formal theory of inductive inference.Part 1,Information and Control,l7,1–22,1964.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Luca, A. (1975). On the entropy of a formal language. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive