| dc.contributor.advisor | Freivalds, Rūsiņš Mārtiņš | en_US |
| dc.contributor.author | Kacs, Vladimirs | en_US |
| dc.contributor.other | Latvijas Universitāte. Datorikas fakultāte | en_US |
| dc.date.accessioned | 2015-03-23T10:16:20Z | |
| dc.date.available | 2015-03-23T10:16:20Z | |
| dc.date.issued | 2012 | en_US |
| dc.identifier.other | 22569 | en_US |
| dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/6742 | |
| dc.description.abstract | Šajā darbā tiek salīdzināti nedeterminēti, frekvenciālie un determinēti transformatori, kā arī tiek noskaidrot to īpašības. Darbā ir pierādīts, ka eksistē relācijas, kuras var aprēķināt frekvenciālu transformatoru, bet nevar ar determinētu.
Atslēgvārdi: Galīgie Automāti, Determinētie Transformatori, Nedeterminētie Transformatori, Frekvenciāli Transformatori. | en_US |
| dc.description.abstract | In this paper author compares deterministic, frequency, and nondeterministic tansducers, as well as determinē their qualities. It is proven in the paper that relations exist, which can be computetd with a frequalntial tansducer, but not a deterministic one.
Keyowrds: Finite state auomata, Deteministic Tansducers, Nondeterminitic Transdiucers, Freuqncy Transducers. | en_US |
| dc.language.iso | N/A | en_US |
| dc.publisher | Latvijas Universitāte | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Datorzinātne | en_US |
| dc.title | Frekvenciāli algoritmi ar ierobežotu atmiņu | en_US |
| dc.title.alternative | Frequential algorithms with limited memory | en_US |
| dc.type | info:eu-repo/semantics/bachelorThesis | en_US |
