bringert
|
160c6354c0
|
Towards smaller SRGs when lots of variants are used.
|
2006-12-15 16:09:58 +00:00 |
|
bringert
|
0fef8d5675
|
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
|
9b7ce588b2
|
Fixed-point iterate unneccessary node removeal.
|
2006-01-05 20:55:13 +00:00 |
|
bringert
|
ededda152b
|
Generate monolithic FAs by expanding an MFA.
|
2006-01-05 20:35:22 +00:00 |
|
bringert
|
6958b7bb7b
|
Remove more unneccessary nodes in SLF networks.
|
2006-01-05 16:48:55 +00:00 |
|
bringert
|
0603e75a14
|
Refactored Graph module. Remove some unneccessary states in slf networks.
|
2006-01-05 16:35:04 +00:00 |
|
bringert
|
3360bd3e7b
|
Print slf_graphviz with subgraphs.
|
2006-01-05 12:59:36 +00:00 |
|
bringert
|
718b6a5fd2
|
Build SLF networks with sublattices.
|
2006-01-04 21:41:12 +00:00 |
|
bringert
|
a9ae24fbc5
|
Finite state networks: more strictness. alternative (still unused) implementation of reachable.
|
2005-12-29 21:35:40 +00:00 |
|
bringert
|
79d771ab1d
|
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
|
72c2289857
|
Finite state networks: replace some lookup tables with maps. Rewrite closure for speed.
|
2005-12-29 16:29:21 +00:00 |
|
bringert
|
999cb3bc07
|
Finite state minimization: improved performance by using Set State instead of [State] as DFA labels.
|
2005-12-29 15:55:48 +00:00 |
|
bringert
|
9981704c5f
|
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
|
5c12a73dae
|
Some performance improvements in the FA generation.
|
2005-12-22 23:16:15 +00:00 |
|
bringert
|
a35dbbeeb8
|
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
|
09a705d192
|
Prepared for generation of finite automata in C.
|
2005-11-10 15:43:44 +00:00 |
|
bringert
|
aef17a14c4
|
Reduced complexity of reachable in FA determinization.
|
2005-10-27 08:16:30 +00:00 |
|
bringert
|
b7609f09a5
|
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
|
e70ebfda5f
|
Added placeholder for minimizing SLF-style automata.
|
2005-09-22 16:08:48 +00:00 |
|
bringert
|
914430a5a8
|
Generated finite state networks are now state minimal.
|
2005-09-22 15:56:05 +00:00 |
|
bringert
|
f4fd1baf8f
|
Fixed some bugs in the Graphviz printer.
|
2005-09-15 17:10:44 +00:00 |
|
bringert
|
efaafffb77
|
Started wotking on NFA to DFA.
|
2005-09-14 17:00:19 +00:00 |
|
bringert
|
0916a479d8
|
Parametrized the type of FAs over the state type.
|
2005-09-14 15:08:35 +00:00 |
|
bringert
|
ffe99a1474
|
Parametrized the Graph type over the node type.
|
2005-09-14 14:29:53 +00:00 |
|
bringert
|
ac8ef799de
|
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
|
775dff9e2b
|
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
|
4ed9ada62e
|
Some preparations for graph minimization.
|
2005-09-12 20:54:32 +00:00 |
|
bringert
|
fea451f06c
|
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
|
8c616b8113
|
Completed unoptimized SLF generation.
|
2005-09-12 14:46:44 +00:00 |
|
bringert
|
936be8eea7
|
Defined compileAutomaton in terms of make_fa
|
2005-09-08 14:39:12 +00:00 |
|
bringert
|
a134b2b6f8
|
Added the prerequisits for automaton building.
|
2005-09-07 13:21:30 +00:00 |
|