home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.theory:1793 comp.misc:3283
- Newsgroups: comp.theory,comp.misc
- Path: sparky!uunet!email!vlsivie!volker
- From: volker@vlsivie.tuwien.ac.at (Volker Hamann)
- Subject: Determinizing non-deterministic finite automata
- Message-ID: <1992Aug21.081542.14847@email.tuwien.ac.at>
- Sender: news@email.tuwien.ac.at
- Nntp-Posting-Host: cuba.vlsivie.tuwien.ac.at
- Reply-To: volker@vlsivie.tuwien.ac.at (Volker Hamann)
- Organization: Technical University of Vienna
- Date: Fri, 21 Aug 1992 08:15:42 GMT
- Lines: 18
-
- Hello!
-
- In the course of implementing regular expression search in hardware, a
- necessity to making non-deterministic finite-state automata deterministic
- has arised.
- Has anybody heard of available software performing this task and probably
- even minimizing the resulting deterministic automaton? What are the interfaces
- to this software if any (input/output format, etc.)?
- I am grateful for any response.
-
- Regards,
-
- Volker
- --
- | /| ! Volker Hamann ! Email: volker@vlsivie.tuwien.ac.at
- | / | ! Department for VLSI Design ! Phone: (++43 1) 58801-8142
- |-/--| ! University of Technology ! Fax: (++43 1) 569697
- |/ | ! Vienna, Austria "IS THERE ANYBODY OUT THERE?"
-