rlsm 0.4.0

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:
= Copier Copié!

installation:
=

Versions:

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

Voir toutes les versions (8)

Dépendances de Development (1):

hoe >= 1.8.2

Show all transitive dependencies

Propriétaires:

Auteurs:

asmodis

Total de contrôle SHA 256:

4a68a0d16fa77c325b6e2dc60844b1f9f7673969ea8c6a4feb2ea5c6d3bd5109