big DFA wanted

xiong@cs.uri.edu (Xuefeng Xiong)
Tue, 25 Apr 1995 18:36:26 GMT

          From comp.compilers
Related articles
big DFA wanted xiong@cs.uri.edu (1995-04-25)
| List of all articles for this month |
Newsgroups: comp.theory,comp.compilers
From: xiong@cs.uri.edu (Xuefeng Xiong)
Keywords: DFA, question
Organization: Computer Science Department, University of Rhode Island
Date: Tue, 25 Apr 1995 18:36:26 GMT

Hi:


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.


----
Xuefeng Xiong
xiong@cs.uri.edu
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.