Displaying similar documents to “Entropy and complexity of a path in sub-Riemannian geometry”

Theories of orders on the set of words

Dietrich Kuske (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

It is shown that small fragments of the first-order theory of the subword order, the (partial) lexicographic path ordering on words, the homomorphism preorder, and the infix order are undecidable. This is in contrast to the decidability of the monadic second-order theory of the prefix order [M.O. Rabin, , 1969] and of the theory of the total lexicographic path ordering [P. Narendran and M. Rusinowitch, , 2000] and, in case of the subword and the lexicographic path order, improves...

Selection Theorem for Systems with Inheritance

A. N. Gorban (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

The problem of finite-dimensional asymptotics of infinite-dimensional dynamic systems is studied. A non-linear kinetic system with for distributions has generically finite-dimensional asymptotics. Such systems are apparent in many areas of biology, physics (the theory of parametric wave interaction), chemistry and economics. This conservation of support has a biological interpretation: . The finite-dimensional asymptotics demonstrates effects of . Estimations of the asymptotic...