bringert
|
215bf61115
|
Towards smaller SRGs when lots of variants are used.
|
2006-12-15 16:09:58 +00:00 |
|
bringert
|
97956fc13f
|
The SLF removeTrivialEmptyNodes optimization could orphan the final node. Fixed this by not bypassing final nodes.
|
2006-04-12 23:22:35 +00:00 |
|
bringert
|
3bf8e5ce6f
|
Fixed-point iterate unneccessary node removeal.
|
2006-01-05 20:55:13 +00:00 |
|
bringert
|
dc3f7e1d61
|
Generate monolithic FAs by expanding an MFA.
|
2006-01-05 20:35:22 +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
|
5c0d9d52b3
|
Print slf_graphviz with subgraphs.
|
2006-01-05 12:59:36 +00:00 |
|
bringert
|
a4ba93cc55
|
Build SLF networks with sublattices.
|
2006-01-04 21:41:12 +00:00 |
|
bringert
|
14079a9d7c
|
Finite state networks: more strictness. alternative (still unused) implementation of reachable.
|
2005-12-29 21:35:40 +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
|
f4f1f04123
|
Finite state networks: replace some lookup tables with maps. Rewrite closure for speed.
|
2005-12-29 16:29:21 +00:00 |
|
bringert
|
5ad1ca8827
|
Finite state minimization: improved performance by using Set State instead of [State] as DFA labels.
|
2005-12-29 15:55:48 +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
|
cb18297ace
|
SLF generation: make sure that there is only one final node, and that it is actually final.
|
2005-12-08 16:01:13 +00:00 |
|
bringert
|
136728e336
|
Prepared for generation of finite automata in C.
|
2005-11-10 15:43:44 +00:00 |
|
bringert
|
9dfa8a5032
|
Reduced complexity of reachable in FA determinization.
|
2005-10-27 08:16:30 +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 |
|
bringert
|
a2ff05dfd9
|
Added placeholder for minimizing SLF-style automata.
|
2005-09-22 16:08:48 +00:00 |
|
bringert
|
9bb01bfc38
|
Generated finite state networks are now state minimal.
|
2005-09-22 15:56:05 +00:00 |
|
bringert
|
5171e7d384
|
Fixed some bugs in the Graphviz printer.
|
2005-09-15 17:10:44 +00:00 |
|
bringert
|
eeb833ca43
|
Started wotking on NFA to DFA.
|
2005-09-14 17:00:19 +00:00 |
|
bringert
|
b109bcaafa
|
Parametrized the type of FAs over the state type.
|
2005-09-14 15:08:35 +00:00 |
|
bringert
|
6381c27bff
|
Parametrized the Graph type over the node type.
|
2005-09-14 14:29:53 +00:00 |
|
bringert
|
a8bc5590af
|
Added Graphviz module for graphviz stuff. Move a lot of utility functions to GF.Data.Utilities.
|
2005-09-14 14:17:29 +00:00 |
|
bringert
|
b90e16b221
|
Cleaned up some stuff while trying to find a bug. Turned out I just had not set the startcat in the grammar file. Time to go home I think.
|
2005-09-12 21:32:24 +00:00 |
|
bringert
|
8e53a8e849
|
Some preparations for graph minimization.
|
2005-09-12 20:54:32 +00:00 |
|
bringert
|
37ef225420
|
Used home-grown graph implementation in FiniteState, to remove dependency on fgl. This also lead to a dramatic performance increase.
|
2005-09-12 20:41:19 +00:00 |
|
bringert
|
ddda900d53
|
Completed unoptimized SLF generation.
|
2005-09-12 14:46:44 +00:00 |
|
bringert
|
9508120dd1
|
Defined compileAutomaton in terms of make_fa
|
2005-09-08 14:39:12 +00:00 |
|
bringert
|
982a522272
|
Added the prerequisits for automaton building.
|
2005-09-07 13:21:30 +00:00 |
|