|
|
Parsing Based on State Grammars
Paulík, Miroslav ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work describes the characteristics of state grammars and n-limited state grammars with a focus on non-determinism in a parsing proccess based on such grammars. In particular, it focuses on the problems caused by enabling erasing productions or by possible occur of recursion. This work also describes possible solutions to non-deterministic problems, which are used in the design of a parallel parsing method. This method is significantly faster than sequence analysis based on backtracking.
|
|
|
Library for Operations over Finite Automata
Bartůněk, Petr ; Puš, Viktor (referee) ; Kaštil, Jan (advisor)
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.
|
|
|
Simulation of Finite Transducers
Micenková, Barbora ; Kolář, Dušan (referee) ; Lukáš, Roman (advisor)
A quick translation between binary code and assembler for the purpose of simulation can be done by a special abstract model - a two-way coupled finite automaton. Its inner representation brings us to the question of finite transducers. As we know that simulation of deterministic transducers is more efficient, we have to concern ourselves with that process. Unfortunately, the existing algorithms are applicable just for transducers translating finite languages while we expect generally infinite language on input. Therefore it is important to find a way how to quickly detect the determinizability of the input transducer. In this bachelor's thesis, so far published works on the determinizability of finite transducers are brought together and a new algorithm of determinization of transducers translating generally infinite languages is presented. Undeterminizable transducers on input are detected.
|
|
|
Multi-Dimensional Languages and Their Automata
Dibďák, Lukáš ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
The Bachelor's Thesis introduces the theory of formal languages and finite automata. It describes generalisation of one-dimensional theory into two dimensions. It introduces basic types of two-dimensional automata, especially on-line tessellation automata. This paper offers algorithms for the process of determinization of on-line tessellation automata. One of the algorithms is used in enclosed application.
|
|
|
Multi-Dimensional Languages and Their Automata
Dibďák, Lukáš ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
The Bachelor's Thesis introduces the theory of formal languages and finite automata. It describes generalisation of one-dimensional theory into two dimensions. It introduces basic types of two-dimensional automata, especially on-line tessellation automata. This paper offers algorithms for the process of determinization of on-line tessellation automata. One of the algorithms is used in enclosed application.
|
|
|
Simulation of Finite Transducers
Micenková, Barbora ; Kolář, Dušan (referee) ; Lukáš, Roman (advisor)
A quick translation between binary code and assembler for the purpose of simulation can be done by a special abstract model - a two-way coupled finite automaton. Its inner representation brings us to the question of finite transducers. As we know that simulation of deterministic transducers is more efficient, we have to concern ourselves with that process. Unfortunately, the existing algorithms are applicable just for transducers translating finite languages while we expect generally infinite language on input. Therefore it is important to find a way how to quickly detect the determinizability of the input transducer. In this bachelor's thesis, so far published works on the determinizability of finite transducers are brought together and a new algorithm of determinization of transducers translating generally infinite languages is presented. Undeterminizable transducers on input are detected.
|
|
|
Parsing Based on State Grammars
Paulík, Miroslav ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work describes the characteristics of state grammars and n-limited state grammars with a focus on non-determinism in a parsing proccess based on such grammars. In particular, it focuses on the problems caused by enabling erasing productions or by possible occur of recursion. This work also describes possible solutions to non-deterministic problems, which are used in the design of a parallel parsing method. This method is significantly faster than sequence analysis based on backtracking.
|
|
|
Library for Operations over Finite Automata
Bartůněk, Petr ; Puš, Viktor (referee) ; Kaštil, Jan (advisor)
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.
|
guest ::
