The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998

18.04.2013 Views

Grail: finite automata and regular expressions Grail: finite automata and regular expressions Grail, by Darrell Raymond and Derick Wood, is a symbolic computation environment for finite-state machines, regular expressions, and other formal language theory objects. Using Grail, one can input machines or expressions, convert them from one form to the other, minimize, make deterministic, complement, and perform many other operations. Grail is intended for use in teaching, for research into the properties of machines, and for efficient computation with machines. Grail is written in C++. It can be accessed either through a process library or through a C++ class library. It can handle machines with 100,000 states and dictionaries of 20,000 words. All code and documentation is accessible from the WWW site http://www.csd.uwo.ca/research/grail. Version 2.5 of Grail enables you to manipulate parameterizable finite-state machines, parameterizable regular expressions, and parameterizable finite languages. By `parameterizable', they mean that the alphabet is not restricted to the usual twenty-six letters and ten digits. Instead, all algorithms are written in a type-independent manner, so that any valid C++ base type and any user-defined type or class can define the alphabet of a finite-state machine or regular expression. ● GRAIL home page ● Download Files (local site) Problem Links ● Finite State Machine Minimization (9) About the Book Send us Mail Go to Main Page This page last modified on Apr 29, 1996. file:///E|/WEBSITE/IMPLEMEN/GRAIL/IMPLEMEN.HTM [19/1/2003 1:40:42]

Calendrical Calculations Calendrical Calculations In two papers, N. Dershowitz and E. Reingold of the University of Illinois provide a uniform algorithmic presentation of a variety of different calendars systems, including the Gregorian, ISO, Julian, Islamic, and Hebrew calendars, as well as other calendars of historical interest. They provide Common Lisp and C++ routines to convert dates between calendars, day of the week computations, and the determination of secular and religious holidays. The implementations of these calendars and the papers describing them are available on our local distribution site. ● Reingold's Calendar Page ● Download Files (local site) Problem Links ● Calendrical Calculations (10) About the Book Send us Mail Go to Main Page This page last modified on May 8, 1996. file:///E|/WEBSITE/IMPLEMEN/REINGOLD/IMPLEMEN.HTM [19/1/2003 1:40:43]

Calendrical Calculations<br />

Calendrical Calculations<br />

In two papers, N. Dershowitz and E. Reingold of the University of Illinois provide a uniform algorithmic<br />

presentation of a variety of different calendars systems, including the Gregorian, ISO, Julian, Islamic,<br />

and Hebrew calendars, as well as other calendars of historical interest. <strong>The</strong>y provide Common Lisp and<br />

C++ routines to convert dates between calendars, day of the week computations, and the determination of<br />

secular and religious holidays.<br />

<strong>The</strong> implementations of these calendars and the papers describing them are available on our local<br />

distribution site.<br />

● Reingold's Calendar Page<br />

● Download Files (local site)<br />

Problem Links<br />

● Calendrical Calculations (10)<br />

About the Book<br />

Send us Mail<br />

Go to Main Page<br />

This page last modified on May 8, 1996.<br />

file:///E|/WEBSITE/IMPLEMEN/REINGOLD/IMPLEMEN.HTM [19/1/2003 1:40:43]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!