Computational Language Related to Recursion, Incursion and Fractal

作者: Daniel M. Dubois

DOI: 10.1007/978-1-4614-9414-0_12

关键词:

摘要: This paper deals with the mathematical presentation of some computational formulas for characterizing natural and artificial languages, as Zipf–Mandelbrot scaling law; Shannon–Weaver entropy; Renyi generalized fractal dimensions applications to fractal, multifractal correlation time series texts. Turing machine is related formal language recursion. By recursive process, can be generated. It shown that generated by incursion, an inclusive or implicit The fundamental property incursion definition a path means iterations are ordered, contrary recursion which parallel iterations. main incursive invertible.

参考文章(32)
Heinz-Otto Peitgen, Hartmut Jürgens, Dietmar Saupe, Chaos and Fractals Chaos and Fractals. ,(2004) , 10.1007/978-1-4757-4740-9
M. Ausloos, Equilibrium and dynamic methods when comparing an English text and its Esperanto translation Physica A-statistical Mechanics and Its Applications. ,vol. 387, pp. 6411- 6420 ,(2008) , 10.1016/J.PHYSA.2008.07.016
M. Ausloos, Punctuation effects in english and esperanto texts Physica A-statistical Mechanics and Its Applications. ,vol. 389, pp. 2835- 2840 ,(2010) , 10.1016/J.PHYSA.2010.02.038
Ludwig Wittgenstein, Tractatus Logico-Philosophicus ,(1921)
S. Kullback, R. A. Leibler, On Information and Sufficiency Annals of Mathematical Statistics. ,vol. 22, pp. 79- 86 ,(1951) , 10.1214/AOMS/1177729694
Dietmar Saupe, Hartmut Jürgens, Heinz-Otto Peitgen, Chaos and Fractals: New Frontiers of Science ,(1992)
A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction Proceedings of the London Mathematical Society. ,vol. s2-43, pp. 544- 546 ,(1938) , 10.1112/PLMS/S2-43.6.544