WIA
2004
Springer
13 years 10 months ago
2004
Springer
d abstract) Gaoyan Xie, Cheng Li, and Zhe Dang School of Electrical Engineering and Computer Science Washington State University Pullman, WA 99164, USA Abstract. In this paper, ...
WIA
2004
Springer
13 years 10 months ago
2004
Springer
WIA
2004
Springer
13 years 10 months ago
2004
Springer
WIA
2004
Springer
13 years 10 months ago
2004
Springer
WIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.
WIA
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
WIA
2004
Springer
13 years 10 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
WIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
WIA
2004
Springer
13 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...
WIA
2004
Springer
13 years 10 months ago
2004
Springer
We present a general weighted grammar software library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. The underlying a...