[Oz] Lazy implementation of automata operations

[Markus Walther]

Hi everybody,

has anyone looked into the suitability of Oz/Mozart for
clean implementation of on-demand (lazy) algorithms for
common finite-state automata operations, in particular intersection?

Unless anybody already has a piece of code, what would be the best
approach? Any pointers to helpful literature?

Suggestions welcome,
--Markus 

-- 
Dr. Markus Walther 
Institut fuer Germanistische Sprachwissenschaft 
Philipps-Universitaet Marburg 
Wilhelm-Roepke-Strasse 6A 
D-35032 Marburg 
Germany 
Tel.: +49-(0)6421-28-2 46 66 (direct line)
Tel.: +49-(0)6421-28-2 59 18 (secretary) 
Fax: +49-(0)6421-28-2 45 58 
home: http://purl.oclc.org/net/walther/
-
Please send submissions to users at mozart-oz.org
and administriva mail to users-request at mozart-oz.org.
The Mozart Oz web site is at http://www.mozart-oz.org/.