Related articles |
---|
working with very large Finite State Machines sjbradtke@home.com (Steve Bradtke) (2001-04-22) |
Re: working with very large Finite State Machines vannoord@let.rug.nl (2001-04-26) |
Re: working with very large Finite State Machines chase@world.std.com (David Chase) (2001-04-26) |
Re: working with very large Finite State Machines rboland@unb.ca (Ralph Boland) (2001-04-26) |
Re: working with very large Finite State Machines rbates@southwind.net (Rodney M. Bates) (2001-04-29) |
From: | vannoord@let.rug.nl |
Newsgroups: | comp.ai.nat-lang,comp.compilers |
Date: | 26 Apr 2001 21:06:20 -0400 |
Organization: | Faculteit der Letteren, Rijksuniversiteit Groningen, NL |
References: | 01-04-117 |
Keywords: | lex |
Posted-Date: | 26 Apr 2001 21:06:19 EDT |
In comp.compilers Steve Bradtke <sjbradtke@home.com> wrote:
> I am working on a project that involves the construction of
> very large Finite State Machines (up to approximately 10^7 states). I
> am looking for software that will allow me to efficiently manipulate
> these beasts. Starting from an initial non-deterministic version, I
> need to be able to find the deterministic and minimal equivalents.
> The automata will be used as components of a machine translation
> project.
Try the FSM library from AT&T. http://www.research.att.com/sw/tools/fsm/
Some other links may be found from the homepage of FSA Utilities, which
is another tool you could try, but which probably will not work well
with such large machines:
http://www.let.rug.nl/~vannoord/Fsa
(as soon as our server is working properly again...)
Gertjan van Noord
--
Gertjan van Noord Alfa-informatica, RUG, Postbus 716, 9700 AS Groningen
vannoord at let dot rug dot nl http://www.let.rug.nl/~vannoord
Return to the
comp.compilers page.
Search the
comp.compilers archives again.