Berkovich E. Groups defined by finite automata of special types.

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

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0412U006890

Applicant for

Specialization

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

10-12-2012

Specialized Academic Board

Д 26.001.18

Taras Shevchenko National University of Kyiv

Essay

The aim of the work is construction of special classes of automata and studying of the groups, defined by automata of these classes, as well as constructing the embedding of wreath powers of a finite group in the automorphism group of a rooted tree. The thesis offers the classification of the states of automata which becomes the basis for distinguishing two special classes of automata - automata without branches, in which the transition function is independent of the input character, and depends only on the state, and the slow-moving automata, which for each state have no more than one character, that turns the automat to another state.

Files

Similar theses