Информационная система "Конференции"

Abstracts

Computability theory

In this work extended notion automata and enter a new class automata is complesity-redused automata. This automata have a good properties: closed under union, intersection, complementation and progection. Proof a theorem determinitation CR-automata. And booleon algebras B(w^n) have a complesity-redused automatic presentation, but not have a automatic presentation. This class automata conclude class of finit automata how subclass.

Full Text in Russian:

Tesis_Nechesov.pdf (120kb)

Mail to Webmaster alc9@math.nsc.ru

|Home Page| |English Part|

Go to Home