|big DFA wanted firstname.lastname@example.org (1995-04-25)|
|From:||email@example.com (Xuefeng Xiong)|
|Organization:||Computer Science Department, University of Rhode Island|
|Date:||Tue, 25 Apr 1995 18:36:26 GMT|
We are looking for deterministic finite state automata (DFA) of big
size, for example, a million of states with multiple input symbols.
They will be used as testing examples for algorithms we developed
recently. It would be better that such automata are from real
applications such as compiler design, circuit design, etc.
Any comments and pointers will be appreciated.
Return to the
Search the comp.compilers archives again.