Bondarenko I. Algorithmic and geometric properties of automaton groups

Українська версія

Thesis for the degree of Doctor of Science (DSc)

State registration number

0515U000883

Thesis Registration Form

0515U000883.pdf

Applicant for

Specialization

  • 01.01.08 - Математична логіка, теорія алгоритмів і дискретна математика

16-11-2015

Specialized Academic Board

Д 26.001.18

Taras Shevchenko National University of Kyiv

Essay

Finite invertible automata and groups, graphs and dynamical systems associated with automata are studied. Algorithmic properties of automaton groups generated by bounded and polynomial automata are investigated. Self-similar measures on limit spaces of self-similar groups are introduced. Properties of action graphs of bounded, polynomial and Hanoi automata are investigated.

Read more

Files

aref.pdf

dis.pdf

Similar theses

0421U102374

Skochko Volodymyr Mykhailovych

The growth of initial invertible automata

0521U101177

Varbanets Serhii Pavlovych

Method on exponential sums in theory of congruential generators of the pseudorandom numbers and asymptotic problems in number theory

0419U004313

Dudenko Marharyta

Metric bases of graphs

0416U004040

Bashova Nadezhda Petrovna

The classification and the calculation of the number of the topologies on the finite sets

0416U000249

Tran Thе Vinh

Applications of the Kloosterman sums in cryptography and coding