rlsm 0.2.4

This is a ruby implementation of three concepts: - Deterministic Finite Automata (DFA) - Regular Expressions (in the sense of theoretical computer sience) - Monoids (an algebraic construct)

Gemfile:
= Copy to clipboard Copied!

install:
=

Versions:

1.8.1 - September 02, 2010 (220 KB)
1.1.0 - October 09, 2009 (28.5 KB)
1.0.0 - March 09, 2009^* (557 KB)
0.4.0 - February 19, 2009^* (546 KB)
0.2.4 - November 16, 2008^* (552 KB)

Show all versions (8 total)

Development Dependencies (1):

hoe >= 1.8.2

Show all transitive dependencies

Owners:

Authors:

asmodis

SHA 256 checksum:

09bd156b37ca753bb1b668f60aac786303c329545ab10a809e5024d063652790