Varbūtiski un ultrametriski algoritmi
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Bakalaura darbā „Varbūtiski un ultrametriski algoritmi” apskatīti un apgūti jēdzieni varbūtisks un ultrametrisks automāts. Izstrādes laikā izveidots varbūtisks un ultrametrisks automāts, kas atpazīst uzdoto valodu L. Automātu izveide deva iespēju salīdzināt abu veidu automātus. Noslēgumā iegūti divi korekti strādājoši automāti un secināts, ka ultrametriskam automātam nepieciešams mazāks skaits stāvokļu nekā varbūtiskam automātam valodas L atpazīšanai.
The bachelor theses „Probabilistic and ultrametric automata” explores the meaning of probabilistic automata and ultrametric automata. During the development of work probabilistic machine and ultrametric machine were create. Both types of automata recognize language L, which was given at the beginning of the work. Created machines let us compare properties of probabilistic automata and ultrametric automata. The work shows that probabilistic automata require more states than ultrametric automata for recognizing language L.
The bachelor theses „Probabilistic and ultrametric automata” explores the meaning of probabilistic automata and ultrametric automata. During the development of work probabilistic machine and ultrametric machine were create. Both types of automata recognize language L, which was given at the beginning of the work. Created machines let us compare properties of probabilistic automata and ultrametric automata. The work shows that probabilistic automata require more states than ultrametric automata for recognizing language L.