Varbūtisku un determinētu algoritmu salīdzinājums
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Darbā tiek salīdzināta varbūtiska un determinēta galīgo automātu darbība izmantojot noteikto valodu L.
Tiek pētīti vienvirziena vienas lentes magazīna automāti. Tiek pierādītas vairākas teorēmas, balstoties uz R. Freivalda pētījumiem. Tiek apskatītas un pielietotas Būla sliekšņa funkcijas iespējas. Darbā tiek piedāvāti dažādi automāta piemēri dotā uzdevuma risināšanā, t.i. valodas L atpazīšanai.
Comparison of randomized and deterministic algorithms. The randomized and deterministic finite state automata are investigated and compared in the bachelor thesis using a certain language L. In this work we investigate one-way one-tape magazine automaton. A number of theorems have been proved based on R.Freivalds studies. Additionally, the capabilities of Boolean threshold functions are discussed and applied. Several automata are described for solving the problem, is namely recognition of the language L.
Comparison of randomized and deterministic algorithms. The randomized and deterministic finite state automata are investigated and compared in the bachelor thesis using a certain language L. In this work we investigate one-way one-tape magazine automaton. A number of theorems have been proved based on R.Freivalds studies. Additionally, the capabilities of Boolean threshold functions are discussed and applied. Several automata are described for solving the problem, is namely recognition of the language L.