Sciweavers

759 search results - page 10 / 152
» Overlap-Free Regular Languages
Sort
View
50
Voted
IJFCS
2010
58views more  IJFCS 2010»
14 years 8 months ago
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time
Pawel Gawrychowski, Dalia Krieger, Narad Rampersad...
85
Voted
IMSCCS
2006
IEEE
15 years 3 months ago
Explicitly Parallel Regular Expressions
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
Brett D. Estrade, A. Louise Perkins, John M. Harri...