38 search results - page 3 / 8 » Minimizing Deterministic Lattice Automata |
92
Voted
WIA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
91
Voted
IMSCCS
2006
IEEE
15 years 5 months ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
127
Voted
FOSSACS
2012
Springer
13 years 7 months ago
2012
Springer
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...
98
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
82
Voted
IPPS
1996
IEEE
15 years 3 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...