National Repository of Grey Literature 40 records found  1 - 10nextend  jump to record: Search took 0.02 seconds. 
Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata
Podhorský, Michal ; Techet, Jiří (referee) ; Masopust, Tomáš (advisor)
This work describes models of modern language theory - finite automata, regular grammars and regular expressions. A web application converting among these models is implemented.
Project Time Tracker
Čevela, Marek ; Grulich, Lukáš (referee) ; Masopust, Tomáš (advisor)
The objective of this bachelor's thesis was acquaint oneself with technologies to develop and run information systems. The practical part of this work is to develop information system Project Time tracker, which enables to monitor time that developers spend on project. The task of system is to gather entries about developer's work on project, process data and provide information about project progress and developer's outcomes.
Store Information System
Hezoučký, Ladislav ; Weiss, Petr (referee) ; Masopust, Tomáš (advisor)
This bachelor's thesis deals with store information system. The main goal of this thesis is to develop  a functional information system which will provide to catch the substance of operations in the stock ( stock receipt and stock out, draw purchase orders, draw invoice ). The system is implemented by using programming languages HTML, PHP and JavaScript. Database MySQL was choosen as a data storage.
Conversions between CF Grammars and Pushdown Automata
Makovský, Benjamin ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This work suggests and solves the implementation of the transformation of context-free grammars and the conversions between context-free grammars and pushdown automata. It makes acquainted with the models used in modern theory of formal languages. In the work are indicated all algorithms necessary for transformations and mutual conversions between context-free grammars and pushdown automata. Proposed is an object representing the grammar and the automaton in the programme. Described is the assigning of definitions of grammar and of the automaton, the solution of drawing the automaton on the screen and the creation of graphical user interface of the application. The resulting programme is developed as Jawa applet which is available on public internet pages www.convertcfg.php5.cz.
Information System of a Bike Service
Škarek, Petr ; Weiss, Petr (referee) ; Masopust, Tomáš (advisor)
The topic of this bachelor's thesis is Bikeservice information system created in PHP language and MySQL database system. The work consists of two sections. The first one includes basic knowledge about information systems, PHP language, MySQL database system and additional technologies used in the work. The second part describes the used database in UML language and the information system, its categorization by the level of user rights, security, and hereafter individual functions and scripts used in the work. The practical part of this work is the information system and its prototypical database enclosed on a CD.
Shortest Paths in a Graph
Krauter, Michal ; Křivka, Zbyněk (referee) ; Masopust, Tomáš (advisor)
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can divide this problem into two following generalizations: single-source shortest path problem and all-pairs shortest paths problem. This text introduces principles and algorithms for generalizations. We describe both classical and new more efficient methods. It contains information about how some of these algorithms were implemented and offers an experimental comparison of these algorithms.
Graph Coloring
Procházka, Lukáš ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This thesis is about graph coloring, which is assigning colors to vertices of a graph such that no two vertices, which are linked with an edge, have the same color. This problem is very computational hard, because it's NP-complete. It's also very important, because it has many practical applications. Here are described some of the heuristic algorithms, which try to solve this problem by iteratively improving the initial solution with given number of colors. Three of them have been implemented, tested on different graphs and compared considering several criteria.
A Restriction of Sentetial Forms of of Scattered Context Grammars
Šimáček, Jiří ; Masopust, Tomáš (referee) ; Meduna, Alexandr (advisor)
This work introduces and discusses generalized scattered context grammars that are based upon sequences of productions whose left-hand sides are formed by nonterminal strings, not just single nonterminals. It places two restrictions on the derivations in these grammars. More specifically, let k be a constant. The first restriction requires that rewriting all symbols occurs within the first k symbols of the first continuous block of nonterminals in the sentential form during every derivation step. The other restriction defines the derivations over sentential forms containing no more than k occurrences of nonterminals. As its main result, the thesis demonstrates that both restrictions decrease the generative power of these grammars to the power of context-free grammars.
Methodology of Construction Compiler Front-End and Its Integration into the GNU Compiler Collection
Machata, Petr ; Masopust, Tomáš (referee) ; Eysselt, Miloš (advisor)
Tato diplomová práce vznikla za podpory ANF DATA s.r.o., Brno. Diplomová práce je vypracována v angličtině. Vstupní bariéra pro vývoj uvnitř GCC se během posledních let znatelně snížila. Na konferencích, v časopisech a na webu se objevují články s architektonickými přehledy a návody. Věci se nadále zjednodušují použitím oficiálního vnitřního jazyka GENERIC: Pro komunikaci mezi přední částí a zbytkem překladače již není nutné zabývat se obtížným a nepřehledným RTL. Přesto je práce se souborem zdrojových kódů velikosti GCC nutně složitá. Je třeba napsat určité soubory a provést určitá nastavení, oboje jen s poměrně malým množstvím dokumentace. Cílem této práce je pomoci s posledním zmíněným bodem. Práce popisuje ukázkovou přední část: Vše od vytvoření zdrojových souborů, přes různé konstrukce jazyka GENERIC, až k problémům s kompilací běhové podpory nebo používání nativního preprocesoru.
Hotelnet Information System
Šturala, Aleš ; Rychlý, Marek (referee) ; Masopust, Tomáš (advisor)
The main objective of my work was to create a system administered over the web interface, where administrators may control users and computers in a small-area network (max. 250 computers). The system is modular to meet requirements of different networks and is administered over the web interface. A part of the whole system is created by PHP scripts for a Linux router, which are connected to the database and can set the router. Users have assigned rights to access to different parts of the system. The system was developed in common technologies like database system PostgreSQL, script language PHP, and mark-up language HTML.

National Repository of Grey Literature : 40 records found   1 - 10nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.