作者: 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.