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
The determinization of a nondeterministic finite automaton (FA) N is the process of generating a det...
The aim of this work is to provide a model for the dynamic implementation of finite automata for enh...
Abstract. We investigate the computational complexity of the nondeterministic finite automaton (NFA)...
This thesis presents new algorithm for complement of nondeterministic finite automata. State-of-the-...
The finite automata are mathematical models for finite state systems. More general finite automaton ...
Abstract. Determinisation of non-deterministic finite automata (NFA) is an impor-tant operation not ...
In automata theory a minimization is the task of transforming a given finite state machine into an e...
Determinisation of nondeterministic finite automata is a well-studied problem that plays an importan...
Nondeterministic finite automaton is an important tool, which is used to process strings in many dif...
A parallel algorithm for the set partitioning problem which has applications in the minimization of ...
The determinization of a nondeterministic finite automaton (NFA) N is the process of generating a de...
AbstractThe paper discusses the problem of the induction of a minimal nondeterministic finite automa...
AbstractIt is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e....
Finite automata appear in almost every branch of computer science, for example in model checking, in...
Abstract. A parallel communicating finite automata system is an accepting device based on the commun...
The determinization of a nondeterministic finite automaton (FA) N is the process of generating a det...
The aim of this work is to provide a model for the dynamic implementation of finite automata for enh...
Abstract. We investigate the computational complexity of the nondeterministic finite automaton (NFA)...
This thesis presents new algorithm for complement of nondeterministic finite automata. State-of-the-...
The finite automata are mathematical models for finite state systems. More general finite automaton ...
Abstract. Determinisation of non-deterministic finite automata (NFA) is an impor-tant operation not ...
In automata theory a minimization is the task of transforming a given finite state machine into an e...
Determinisation of nondeterministic finite automata is a well-studied problem that plays an importan...
Nondeterministic finite automaton is an important tool, which is used to process strings in many dif...
A parallel algorithm for the set partitioning problem which has applications in the minimization of ...
The determinization of a nondeterministic finite automaton (NFA) N is the process of generating a de...
AbstractThe paper discusses the problem of the induction of a minimal nondeterministic finite automa...
AbstractIt is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e....
Finite automata appear in almost every branch of computer science, for example in model checking, in...
Abstract. A parallel communicating finite automata system is an accepting device based on the commun...
The determinization of a nondeterministic finite automaton (FA) N is the process of generating a det...
The aim of this work is to provide a model for the dynamic implementation of finite automata for enh...
Abstract. We investigate the computational complexity of the nondeterministic finite automaton (NFA)...