This thesis main focus is microscopic traffic sumulation. Part of this work is the design and implementation of microsimulation model based on cellular automaton. Implemented model supports calibration with genetic algorithm. The results of calibration and simulations are included.

The aim of this paper is to introduce the readers to the field of cellular automata, their design and their usage for structural design. Genetic algorithms are usually involved in designing complicated cellular automata, and because of that they are also briefly described here. For the purposes of this work sorting networks are considered as suitable structures to be designed using cellular automata, however, they are not a part of the automata but they are generated separately by modified rules of a local transition function.

This master's thesis deals with cellular automata and further deals possibility of their global control. It describes the implementation of simulator of globally controlled cellular automata. The goal is, design and test the classification of globally controlled cellular automata. Classification is based on evaluation of influence of each parameter of automata on their dynamics.

This master's thesis deals with modelling and simulation of physical phenomena by cellular automata. The basic methods which model physical phenomena is enumerated and descibed in this thesis. One of the important part of this thesis is a set of demonstration models. Each model is focused on one selected area of physical phenomena. All models are described by transtition rules and the procedure of derivation of these rules is also presented here. There rules were used in implemented models.  Another part of this thesis contains of a simulation application for these models. The real application had been implemented in accord with this design and it has been used to perform the simulation experiments with exemplary models. Results of the simulation experiments are discussed in conclusion of this thesis. One exemplary model had also been adapted for parallel processing. The performances on a computer with different count of working processors were measured and are also discussed in the conclusion of this thesis

This work deals with two basic operations over finite automata. Determination of nondeterministic finite automata and minimization of deterministic finite automata. For these two operations I proposed sequential algorithms that are parallelizable. I deal mainly with finding the speedup of SSE instructions, or use the OpenMP library. The trend today is mainly in increasing the number of processors, so I propose parallel algorithms for multiple processors. When searching for the optimal solution, I will be to examine other ways to achieve speedup, for example efficient saving of the data structures in memory.

The theme and goal of this diploma is a draft and a method of application of a drive algorithm of an omni directional robot. The robot is driven with the aid of a PCL from the X20 series, produced by Bernecker&Rainer. The propulsion is provided using 3 integrated regulating driving mechanisms, IclA D065 produced by SIG Positec, which communicate via the CAN bus. Furthermore, the robot uses sensors to read the positioning of its chassis and undercarriage in order to identify the traction quality of the surface of the terrain below and subsequently reduce skidding. This sensor uses the RS 232 bus to communicate with the PLC. Thanks to all the above-mentioned and characteristics of power supply, the result achieved is a totally autonomous machine.

In modernen Fahrzeugen befindet sich eine Vielzahl von Steuergeräten, die verschiedenste Funktionen, wie z.B. das Antiblockiersystem (ABS) realisieren. Die Funktionalitäten von Steuergeräten werden heute mit unterschiedlichen Methoden beschrieben. Eine dieser Methoden sind Message Sequence Charts (MSCs). Aufgrund der Freiheitsgrade von MSCs gibt es verschiedene Möglichkeiten gleiche Funktionalität unterschiedlich zu beschreiben. In dieser Arbeit wird eine Methode definiert, wie verschiedene MSCs hinsichtlich Funktionskompatibilität auf Basis von endlichen Automaten untersucht werden können. Diese Diplomarbeit ist in zwei Schwerpunkte gegliedert. Zum einen soll ein Konzept für die Transformation des MSCs in der entsprechenden Automaten-Darstellung und einen Vergleich-Algorithmus zur Rückwärtskompatibilitätsanalyse der endlichen Automaten entwickelt werden. Zum anderen ist es Aufgabe, die Methode auf Basis von Java zu implementieren und in die Software-Plattform CAMP zu integrieren.

In the first part of this thesis, a Chomsky-Schützenberger characterisation and an automaton characterisation of multiple context-free grammars are proved. Furthermore, a framework for approximation of automata with storage is described. The second part develops each of the three theoretical results into a parsing algorithm.

The master thesis deals with controlling and function principles of LCDs. Various LCD types are described, as well as means of control and generic description of LCD controller function blocks. They are implemented in VHDL language, simulation and simulation results are realized using FITkit platform.

Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this report we study the problems of intersection, complementation and inclusion for weighted automata on infinite trees and show that they are not harder than reasoning with unweighted automata. We also present explicit methods for solving these problems optimally.