|
|
Demonstrations of Jumping Automata
Růžička, Ladislav ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike conventional finite automata that read input words continuously these automatas make a jump over some symbols and from there it can read a symbol. In this paper we will be mostly focused on finding a practical algorithm for solving the membership problem. As will be shown the membership problem for jumping finite automata can be reduced to finding a non-negative integral solution to a Quantifier-Free Presburger arithmetics formula. From such formula we are able to determine whole infinite language of jumping finite automata. We will show that some subset of jumping finite automata can be solved in polynomial time. We note that formula in Presburger arithmetics can be transformed to the corresponding concurent finite automata. Unfortunately for general jumping automata finding non-negative solution is not sufficent but it can reduce search space. Other heuristics will be presented that increase the effectivity for the general jumping finite automata acceptance process.
|
|
|
Environment for Formal Language Models Support
Juda, Jan ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
The goal of this thesis is to create an environment that supports advanced formal language models including the computation of algorithms for typical problems. This environment is developed as a modular application using OSGi framework, that focuses on easy integration of new user-defined formal language models and algorithms for these models. The modularity provides the possibility to integrate a new user-defined language model and the corresponding algorithms without necessity to recompile the rest of the system. Therefore, a new module can be seamlessly plugged in into the system. As a demonstration of its capabilities, the environment supports the models of finite automata, context free grammars, n-pushdown m-tape automata, general jumping finite automata, Watson-Crick finite automata, the membership problem and algorithms that are generally able to solve membership problem on automata and grammars.
|
|
|
Demonstrations of Jumping Automata
Růžička, Ladislav ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike conventional finite automata that read input words continuously these automatas make a jump over some symbols and from there it can read a symbol. In this paper we will be mostly focused on finding a practical algorithm for solving the membership problem. As will be shown the membership problem for jumping finite automata can be reduced to finding a non-negative integral solution to a Quantifier-Free Presburger arithmetics formula. From such formula we are able to determine whole infinite language of jumping finite automata. We will show that some subset of jumping finite automata can be solved in polynomial time. We note that formula in Presburger arithmetics can be transformed to the corresponding concurent finite automata. Unfortunately for general jumping automata finding non-negative solution is not sufficent but it can reduce search space. Other heuristics will be presented that increase the effectivity for the general jumping finite automata acceptance process.
|
guest ::
