Categories: None [Edit]
fa
Bindings for libfa, a library to manipulate finite automata. Automata are
constructed from regular expressions, using extended POSIX syntax, and make
it possible to compute interesting things like the intersection of two
regular expressions (all strings matched by both), or the complement of a
regular expression (all strings _not_ matched by the regular
expression). It is possible to convert from regular expression (compile) to
finite automaton, and from finite automaton to regular expression
(as_regexp)
Total
Ranking: 117,589 of 183,477
Downloads: 5,292
Daily
Ranking: 63,432 of 183,470
Downloads: 0
Downloads Trends
Ranking Trends
Num of Versions Trends
Popular Versions (Major)
Popular Versions (Major.Minor)
Depended by
Rank | Downloads | Name |
---|
Owners
# | Gravatar | Handle |
---|---|---|
1 | lutter |