Newsgroups: comp.ai.nat-lang,comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!news.mathworks.com!hookup!news.sprintlink.net!EU.net!sun4nl!freya.let.rug.nl!vannoord
From: vannoord@let.rug.nl (Gertjan van Noord)
Subject: Re: code for finite automata
Sender: news@let.rug.nl (News system at let.rug.nl)
Message-ID: <1995Feb12.213650.17023@let.rug.nl>
Date: Sun, 12 Feb 1995 21:36:50 GMT
References: <3hfq8c$9cf@lyra.csx.cam.ac.uk> <PEREIRA.95Feb10222452@radish.research.att.com> <ET.95Feb12104515@burns.cogsci.ed.ac.uk>
Nntp-Posting-Host: tyr.let.rug.nl
Organization: Faculteit der Letteren, Rijksuniversiteit Groningen, NL
Lines: 24
Xref: glinda.oz.cs.cmu.edu comp.ai.nat-lang:2880 comp.lang.prolog:12255

>> In article <3hfq8c$9cf@lyra.csx.cam.ac.uk> etg10@cl.cam.ac.uk
>> (Edmund Grimley-Evans) writes: Does anyone know of any public-domain
>> code for manipulating finite automata, i.e. intersecting them,
>> minimising them, doing unions, etc?  Prolog would be best.
>
>In article <PEREIRA.95Feb10222452@radish.research.att.com> pereira@radish.research.att.com (Fernando Pereira) writes:
>
>> I wouldn't hold my breath for really efficient FSA intersection,
>> determinization or minimization in Prolog. All those algorithms
>> depend on imperative algorithms to achieve decent
>> performance. Imperative algorithms in Prolog require using assert
>> etc, which have awful constant multipliers. Either Prolog extensions
>

as an exercise (for myself..) I implemented a determinizator. Please
bear in mind Fernando's comment in judging it. I concentrated in making
the resulting program as fast as possible, rather than the conversion
step.

I will put it on our ftp server:
	ftp.let.rug.nl:pub/prolog-app/fsa.tgz



