11 search results - page 1 / 3 » wia 2004 |
80
Voted
WIA
2004
Springer
15 years 6 months ago
2004
Springer
84
Voted
WIA
2004
Springer
15 years 6 months ago
2004
Springer
72
Voted
WIA
2004
Springer
15 years 6 months ago
2004
Springer
93
Voted
WIA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.
109
Voted
WIA
2004
Springer
15 years 6 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...