11 search results - page 1 / 3 » wia 2004 |
113
Voted
WIA
2004
Springer
15 years 10 months ago
2004
Springer
102
Voted
WIA
2004
Springer
15 years 10 months ago
2004
Springer
122
Voted
WIA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.
140
click to vote
WIA
2004
Springer
15 years 10 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...