|
|
Automata Applied in Visual Arts
Albrecht, Kryštof ; Havel, Martin (referee) ; Meduna, Alexandr (advisor)
Tato práce představuje nový programovací jazyk, určený ke kompozici dvourozměrných vizuálních efektů. Jazyk je založen na upravené verzi celulárních automatů navržené pro kompozici. Hlavní platformou, kde efekty mají běžet, je herní engine Godot, kde jsou efekty realizovány pomocí fragment shaderů.
|
|
|
Efektivnost datových strukur v implementaci automatů
Koval, Milan ; Smrčka, Aleš (referee) ; Holík, Lukáš (advisor)
Tato Prace se soustředí na optimalizaci knihovny Mata, která je součastným leaderem na poli vykonu v oblasti operací nad automaty. Výrazdné zlepšení výkonu je dosáhnuto pomocí modifikovaného lineárního alokátoru, využitím append-only vlastnosti reprezentace automatu umozňue bleskově rychlé konstrukce a bleskově rychlým pristupúm do paměti díky prostorove lokalitě. Nálezem této práce není pouze rychlejší už ta nejrychlejší knihovna Mata ale take použitelnost lineárních alokátorů jako normálně používaná praxe při append-only strukturách, speciálně v výkonově kritických případech.
|
|
|
Congruences for Tree Automata
Žufan, Petr ; Janků, Petr (referee) ; Holík, Lukáš (advisor)
This thesis discusses testing of tree automata (TA) equivalence. We propose a new algorithm based on Bonchi Pouse's algorithm of word automata. The new algortihm combines bisimulation and determinization on the fly. Using an optimalization based on congruence closure, we try to avoid extreme expansion of state space. From this point of view, the new algorithm is better than others.
|
|
|
A Combination of Automata and Grammars
Kučera, Jiří ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
V této práci byly zavedeny a studovány nové systémy formálních modelů, zvané stavově synchronizované automatové systémy stupně n . Výpočet je v těchto prezentovaných systémech řízen pomocí slov patřících do konečného řídícího jazyka, kde každé slovo z tohoto jazyka je složeno ze stavů komponent systému. Dále byla v této práci studována výpočetní síla zavedených systémů. Praktické použití zavedených systémů bylo demonstrováno na příkladu z oblasti překladu přirozených jazyků a dále na příkladu z oblasti paralelního překladu.
|
|
|
Mechatronics design of furniture dowels producing machine
Šubrt, Kamil ; Andrš, Ondřej (referee) ; Houška, Pavel (advisor)
This work deals with the suggestion of self-operating machine for the manufacture of furniture pins from the cylindrical pin blanks. The paper analyzed the possibility of production automation of furniture pins, which has been based on long experience with their production. Subsequently, there was suggested a design of machine using V-cycle methodology. In this proposition was gradually developed the machine construction and its management. Construction of this machine presented by 3D CAD model is connected to the development environment NI LabVIEW. Operating of the machine was designed and verified through co-simulation. The machine proposition was achieved trough successive iterations of development which meets the requirements. In the conclusion of this project was done analysis of choice suitable management system for the real machine.
|
|
|
New Versions of Jumping Automata
Ošmera, Lubomír ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
The main goal of this thesis is introduction and investigation of extended version of jumping automata. These versions are specified by strictly size and direction of jump. This thesis examine their power and perform comparison with other automata types. Also there are shown equivalent grammar models. Main motivation for this thesis are research and effort to improve some features of general jumping finite automata. This work consider using this automata types for specific language families and syntactic analysis process.
|
|
|
Implementation of a operating software for manipulator Mini-Swing
Pražák, Ondřej ; Hejč, Tomáš (referee) ; Houška, Pavel (advisor)
The bacheleor thesis deal with operation of the robotic manipulator Mini-swing with three controlled axes. An application was designed to control the movement of the whole manipulator with the option of entering different working points. Furthermore, a real-time controlling application was designed in order to control the individual motors of the manipulator. Both applications are implemented in NI LabVIEW environment and they are able to communicate with each other with the help of shared network variables.
|
|
|
Semi-Parallel Deep Pushdown Automata
Ševčík, Miroslav ; Zámečníková, Eva (referee) ; Meduna, Alexandr (advisor)
This work introduces semi-parallel deep pushdown automata as an extension of sequential deep pushdown automata. Unlike the sequential automaton, a semi-parallel one is able to make expansions of n nonterminal symbols on the pushdown top simultaneously. These automata, same as sequential deep pushdown automata, define the family of languages generated by n-limited state grammars. The advantage of semi-parallel deep pushdown automata lies in higher speed. This work also describes the implementation of an aplication that simulates operation of these automata.
|
|
|
Regulated Syntax-Directed Translation
Dvořák, Tomáš ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis deals with formal and syntax directed translation. This thesis contains theoretical part, which defines regular, context free, context sensitive and recursively enumerable languages a grammar. There are given examples of grammars which are able to generate languages that are not context free. Covered by this thesis are matrix grammars, random context grammars and programed grammars. Researched are also finite, pushdown, deep and regular automata, transducers and their part within format syntax directed translation. This project also defines regular transducers based as regulated automata. Thesis defines regulated methods of syntax analysis based on predictive parsers. These methods cover analysis of studied regulated grammars. The final part of this thesis describes new language capable of effective description of these grammars and compiler producing parser code for these grammars written in this new language and their graphical analyzer.
|
|
|
Forming Machine Control System
Vaško, Jiří ; Fojtík, Pavel (referee) ; Kučera, Pavel (advisor)
This master thesis deals with the implementation of the control system for the forming machine used in producing of confectionery forms. The introductory part describes the forming machine from the point of important control elements. The second part is associated with the hardware design of the control automat and description of main functional units on the control PCB, as well as on other PCBs. The following text presents the communication protocol between the control automat and PC and after that there is a description of the CPU firmware. The final section brings the characteristics of the PC application for a connection with the automat.
|
guest ::
