Internet of Things(IoT) has in recent years become a topic of broad and current interest. The purpose of this thesis is to anticipate weather conditions by constructing a system for collecting information about atmospheric pressure. The development of the system will solve the following problem: it should be possible to implement a system that allows for the collection of information from sensors through a mobile phone. The problem was solved through an iOS application together with a Micro Controller Unit (MCU) and a sensor. To collect weather data, the BME280, with its atmospheric pressure, temperature and humidity sensor, was used. Bluetooth was chosen for the interaction between the Automat and the iOS application. This proved to be a possible solution to a problem in a growing area of application. An advantage to this hardware solution is the mobility and flexibility of the Automat, making it ideal for mobile IoT solutions. Arduino is, however, the better choice for developers, as it has a larger community and clear documentation. / Internet of Things (IoT) har på senare år blivit ett alltmer omtalat område. Syftet med tesen är att förutspå väderförhållanden genom att konstruera ett IoT system som samlar in information om lufttryck, detta för att besvara frågeställningen: Det bör gå att samla in sensordata med hjälp av mobiltelefon. För att besvara detta följdes Ekholms modell för teknisk forskning och arbetsmetoden Scrum. Frågestallningen löstes genom en iOS applikation med tillhörande Microcontroller Unit(MCU) och sensor. För att samla in väderdata användes sensorn BME280, som har lufttrycks-, temperaturoch luftfuktighetssensorer, tillsammans med MCU:n Automat. För interaktionen mellan Automat och iOS applikationen tillämpades bluetooth-kommunikation. Detta var en möjlig lösning på ett problem i ett växande tillämpningsområde. Fördelar med denna lösning av hårdvara är att den är välanpassad till mobila IoT lösningar tack vare Automats minimala storlek i förhållande till funktionalitet. I många fall är däremot Arduino ett bättre val för utvecklaren, då den har större samfund och tydligare dokumentation.

This thesis investigates multi pushdown automata and introduces their   new modifications based on deep pushdown.  The first modification is Input driven multi deep pushdown automata, which has several deep pushdown lists and the current input symbol determines whether the automaton performs a push operation, a pop operation, an expansion operation or does not touch the stack. The second introduced modification is Regulated pushdown automata by deep pushdown. In addition to ordinary pushdowns, this version contains deep pushdown, which is used to generate the control language. This thesis proves, that the acceptance power of the described variants  is equal to the accepting power of Turing machines.  This thesis also contains view on program realisation of theoretical models, which were described in the theoretical part and introduces a library for the syntax analysis, which is based on it.

Master's thesis is dealing with translation based on coupled finite automaton model. Coupled finite automaton contains input and output automaton. The input automaton makes syntactic analysis with an input string. Used rules from the input automaton control the output automaton, which generates an output string. In thesis is described a way of determinisation of the input automaton without loss of information about rules used in original automaton. The determinizitaion is divided into two parts - for finite and infinite translation specified by transducers. Then is presented a new pair automaton with increased computing power. This increased computing power consists in replace of input or output or just a part of automaton by context free grammar.

Vyhledávání regulárních výrazů má ve vývoji softwaru nezastupitelné místo. Rychlost vyhledávání může ovlivnit použitelnost softwaru, a proto je na ni kladen velký důraz. Pro určité druhy regulárních výrazů mají standardní přístupy pro vyhledávání vysokou složitost. Kvůli tomu jsou náchylné k útokům založeným na vysoké náročnosti vyhledávání regulárních výrazů (takzvané ReDoS útoky). Regulární výrazy s omezeným opakováním, které se v praxi často vyskytují, jsou jedním z těchto druhů. Efektivní reprezentace a rychlé vyhledávání těchto regulárních výrazů je možné s použítím automatu s čítači. V této práci představujeme implementaci vyhledávání regulárních výrazů založeném na automatech s čítači v C++. Vyhledávání je implementováno v rámci RE2, rychlé moderní knihovny pro vyhledávání regulárních výrazů. V práci jsme provedli experimenty na v praxi používaných regulárních výrazech. Výsledky experimentů ukázaly, že implementace v rámci nástroje RE2 je rychleší než původní implementace v jazyce C#.

The aim of this thesis is to observe behavior of traffic flow and to verify or refute traditional so called fundamental relationships. It analyze data based on older measurements, personal measurements executed on the I/43 road, and mathematical models.There were three tools used provided by "VUT" in Brno as well as own developed tool based on cellular automat..

This thesis elaborates the Büchi automata theory and introduces a library that enables working with them. Basics of the automata theory is explained. The main part of this work is focused on Büchi automata, which belong to finite automata. The main properties of Büchi automata are explained and proved. The knowledge of those properties is important for understanding the algorithms mentioned in this work. The next part describes those algorithms and explains their principles in details. The design of library is described in the next part of this work. Main part is aimed at the implementation of the library and auxiliary scripts. The most interesting and important parts of methods are described in detail. Closing part describes testing of library functionality.

This paper introduces and discusses automata systems as a new way for formal languages processing. In the text there are four models described. The first model works on sequential mode. At one computation step only one of components works. The second one works on semi-parallel mode. At the one computation step either one or all the components of the automata system work. In the last two models each component of the automata system has its own input string. The computation step of each component is influenced by their states, or used rules. The state, or used rule of the components of automata system can block or unblock some or all automata of the system.

In this thesis, I focus on the application of deep pushdown automatons in compilers, their composition in the parser, and the possibility of further recovery. Thanks to these automatons can carry out the expansion of the nonterminals in various depths and thus makes it possible to use other records of expressions.

This thesis presents the process of creating disassembler for new designed processors. We demand automatic generation of the disassembler. Instruction set for processor is modeled by specialized language ISAC, which offers resources for description of the instruction set. For example it describes format of instruction in the assembly language or format of instruction in the binary form or behavior of this instruction. Internal model is coupled finite automata, which describes relation of textual form of the instruction and binary form of the instruction in formal way. The code of disassembler is generated from the internal model. This disassembler accepts program in binary code at the input and generate equivalent program in assembly language at the output.

This paper discusses the implementation of a suitable algorithm for code generation from UML state machine diagrams. The work includes analysis of state machines described in UML, followed by a description of the input fi le format of the proposed design of the generator and the generator itself. The generator was fully implemented in the work along with other functional requirements. At the end of this thesis is a description of the resulting implementation.