|
|
Regular Expression Based Searching in Text Files
Šimek, Ota ; Samek, Jan (referee) ; Rozman, Jaroslav (advisor)
This paper desribes the design, analysis and implementation of the program, whichis used to search for specific parts of text in text and xml files. To search, you must create a template using two text-matching technigues. These are the regular expressions and XPath expressions. This is desribed in the first chapter. Application allows to process large number of files or files with a high content.
|
|
|
Dictionary Up-Translation System
Schovajsa, Michal ; Kouřil, Jan (referee) ; Smrž, Pavel (advisor)
The thesis concerns with the processing of dictionaries in electronic form, converting them into an unified form, and the problems arising in the process in particular. The subject of the work is to create a system for the elimination of some of these problems in order to facilitate machine processing of dictionaries. At first, different issues of dictionaries transferred into an unified form are concerned. Then, the thesis deals with the solution of these issues and the creation of tools for this purpose. Finally, the results and the efficiency of the instruments created are evaluated.
|
|
|
Automatic Grouping of Regular Expressions
Stanek, Timotej ; Kořenek, Jan (referee) ; Kaštil, Jan (advisor)
This project is about security of computer networks using Intrusion Detection Systems. IDS contain rules for detection expressed with regular expressions, which are for detection represented by finite-state automata. The complexity of this detection with non-deterministic and deterministic finite-state automata is explained. This complexity can be reduced with help of regular expressions grouping. Grouping algorithm and approaches for speedup and improvement are introduced. One of the approches is Genetic algorithm, which can work real-time. Finally Random search algorithm for grouping of regular expressions is presented. Experiment results with these approches are shown and compared between each other.
|
|
|
Construction of the Generalized Finite Automaton
Šoka, Martin ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
The thesis deals with the creation of an algorithm for the construction of the generalized finite automaton. This automaton differs from the conventional finite automaton by the fact that its transitions are defined by words, therefore it is possible to reduce the number of states of the generalized finite automaton. The introduction includes definitions of terms used later in the thesis. In the next chapters I describe the algorithm itself, including the comprehensive analysis of the heuristics for finding a maximal acyclic subgraph in the graph of the automaton. It also describes implementation of the algorithm and experimentation with automatons created by the algorithm.
|
|
|
Graphical Simulation of Finite Automata
Šrajer, Roman ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
This Bachelor's Thesis is about the theory of converting regular expression to finate state machine and vice versa. The goal of practical part is to make web application that performs these coversions and do simulation for input string. For converting automata into regular expression it is used the algebraic method which is based on making an equation system to be solved. I have chosen Java as programming language and Java Applet and Java Web Start as technologies that make possible to access the application through the web page. The possibilities like working with three types of automata views, saving atomatons into XML and intuitively creating own automatons are the important part of the application.
|
|
|
Alternative Transformations of Language Models
Havel, Martin ; Beníčková, Zuzana (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformation from regular expression to finite automata. The thesis proposes new transformation focused on minimal count of states and rules of finite automatas. Concept of alternative transformation is processed into algorithms and proved by mathematical proofs. The aim of thesis is to introduce approaches to transformation with new ones in the field of regular expressions and finite automatas. Great attention is dedicated to economic perspective of final finite automata. There were created algorithms, which are capable of transformation regular expression to finite automata. This work also provides a simple recipe for implementation of these structures. We introduced generic concept of transformation, that allows to create less complicated finite automatas. Using presented techniques it is possible to expand known transformation with new ones.
|
|
|
Language Version Tools for Web Portal of BUT
Pavlíček, Milan ; Burget, Radek (referee) ; Marušinec, Jaromír (advisor)
The main purpose of this master's thesis is to create language version tools for web Portal of BUT. There are possibilities of applications using databases or without them. The next part of the thesis analyses current situation of the web Portal of BUT. I described individually servers, tools and mainly solution ensuring multilingual sites. Thereinafter I attend to design and implementation of required system. This system consists of some single scripts and web applications for web developers and translators. Finally I will describe the procedure of integration of this system to current web Portal of BUT.
|
|
|
Algorithm Database of Digital Audio Signal Processing with Automatic Classification and Searching using Web Interface
Kouba, Petr ; Sysel, Petr (referee) ; Schimmel, Jiří (advisor)
The aim of the bachelor was to design a database structure for classification source code and implementations of digital audio effects algorithms. Classification criteria for these algorithms are described in the thesis. A new project can be added to the database using web form or via of the automatic classification. The automatic classification is called a function for automatic recognition information in source files. For this purpose a format of saving catalog information into the source file was designed. These saved data can be further recognized by the suitable algorithm which utilizes PHP standard functions and then they inserted into the database. The saved projects can be searched by the project name, author’s name, the project description, or the criteria described in the introduction of this thesis.
|
|
|
Alternative Transformations of Language Models
Havel, Martin ; Beníčková, Zuzana (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformation from regular expression to finite automata. The thesis proposes new transformation focused on minimal count of states and rules of finite automatas. Concept of alternative transformation is processed into algorithms and proved by mathematical proofs. The aim of thesis is to introduce approaches to transformation with new ones in the field of regular expressions and finite automatas. Great attention is dedicated to economic perspective of final finite automata. There were created algorithms, which are capable of transformation regular expression to finite automata. This work also provides a simple recipe for implementation of these structures. We introduced generic concept of transformation, that allows to create less complicated finite automatas. Using presented techniques it is possible to expand known transformation with new ones.
|
|
|
Alternative Transformations of Language Models
Havel, Martin ; Beníčková, Zuzana (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformation from regular expression to finite automata. The thesis proposes new transformation focused on minimal count of states and rules of finite automatas. Concept of alternative transformation is processed into algorithms and proved by mathematical proofs. The aim of thesis is to introduce approaches to transformation with new ones in the field of regular expressions and finite automatas. Great attention is dedicated to economic perspective of final finite automata. There were created algorithms, which are capable of transformation regular expression to finite automata. This work also provides a simple recipe for implementation of these structures. We introduced generic concept of transformation, that allows to create less complicated finite automatas. Using presented techniques it is possible to expand known transformation with new ones.
|
guest ::
