 bringert
|
dc3f7e1d61
|
Generate monolithic FAs by expanding an MFA.
|
2006-01-05 20:35:22 +00:00 |
|
|
bringert
|
ca84f92302
|
Remove unused sub-networks when generating multiple FAs.
|
2006-01-05 17:46:30 +00:00 |
|
|
bringert
|
bffc7df07e
|
Remove more unneccessary nodes in SLF networks.
|
2006-01-05 16:48:55 +00:00 |
|
|
bringert
|
12187f684e
|
Refactored Graph module. Remove some unneccessary states in slf networks.
|
2006-01-05 16:35:04 +00:00 |
|
|
bringert
|
d854890820
|
Fintie state networks: fixed stack overflow problem with strictness in Graph and FiniteState. Some clean-up and smaller performance fixes.
|
2005-12-29 20:24:34 +00:00 |
|
|
bringert
|
cb5e52bd2e
|
Finite state network generation: reimplemented getOutgoing using Data.Map to improve performance of minimize with large networks.
|
2005-12-29 13:33:58 +00:00 |
|
|
bringert
|
e32472a9bb
|
Some performance improvements in the FA generation.
|
2005-12-22 23:16:15 +00:00 |
|
|
bringert
|
136728e336
|
Prepared for generation of finite automata in C.
|
2005-11-10 15:43:44 +00:00 |
|
|
bringert
|
3d4200d3fe
|
Moved Graph and Relation stuff to separate modules. Added some QuickCheck properties for Relation. Improved relation datastructure and algorithms, making FA generation much faster.
|
2005-10-26 16:13:13 +00:00 |
|