| Age | Commit message (Expand) | Author |
|---|---|---|
| 2006-12-15 | Towards smaller SRGs when lots of variants are used. | bringert |
| 2006-01-05 | Generate monolithic FAs by expanding an MFA. | bringert |
| 2006-01-05 | Remove unused sub-networks when generating multiple FAs. | bringert |
| 2006-01-05 | Remove more unneccessary nodes in SLF networks. | bringert |
| 2006-01-05 | Refactored Graph module. Remove some unneccessary states in slf networks. | bringert |
| 2005-12-29 | Fintie state networks: fixed stack overflow problem with strictness in Graph ... | bringert |
| 2005-12-29 | Finite state network generation: reimplemented getOutgoing using Data.Map to ... | bringert |
| 2005-12-22 | Some performance improvements in the FA generation. | bringert |
| 2005-11-10 | Prepared for generation of finite automata in C. | bringert |
| 2005-10-26 | Moved Graph and Relation stuff to separate modules. Added some QuickCheck pro... | bringert |
