184 search results - page 2 / 37 » A New Algorithm of Constructing the Basis Finite Automaton |
JUCS
2002
13 years 4 months ago
2002
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
ACL
1998
13 years 6 months ago
1998
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an autom...
ISOLA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
CIS
2006
Springer
13 years 9 months ago
2006
Springer
In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementati...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...