joshua/nominal-lstar
1
Fork 0
mirror of https://github.com/Jaxan/nominal-lstar.git synced 2025-04-26 22:27:46 +02:00
Code Issues Releases Activity
64 commits 1 branch 0 tags 214 KiB
Commit graph

64 commits

This branch
This branch
All branches
Author SHA1 Message Date
Joshua Moerman
f8c7b8d766 A little bit more on Mealy machines and updates the README 2024-10-18 16:36:36 +02:00
Joshua Moerman
91d4c6d539 Removed gauge and added tasty and some tests (working towards mealy machines) 2024-10-18 16:07:21 +02:00
Joshua Moerman
9c212ccfda Revert previous workaround, as NLambda is now updated 2023-07-12 21:33:21 +02:00
Joshua Moerman
eb94b82251 Replaces all NominalType with Nominal 2023-05-31 15:52:17 +02:00
Joshua Moerman
98f9c6e295 Also simplifies the L* algorithm, which is now a bit faster 2021-02-25 16:32:17 +01:00
Joshua Moerman
2004c75471 Got rid of redundant queries + minor changes 2021-02-25 14:56:00 +01:00
Joshua Moerman
7b41e7d97c Faster version of the nominal NL* algorithm by specialising the observation table to Booleans 2021-02-25 14:35:40 +01:00
Joshua Moerman
c2b2907555 Adds a class for tables 2021-02-22 13:28:42 +01:00
Joshua Moerman
9a75d5f296 Made a decent automated benchmark 2020-11-19 13:04:12 +01:00
Joshua Moerman
c4a34b9039 fixed some warnings and did some small cleanup 2020-11-17 12:21:46 +01:00
Joshua Moerman
78bb8ef823 added a benchmark 2020-11-11 16:46:18 +01:00
Joshua Moerman
1e092a319b (Re)moved some simplify to make it more efficient 2020-11-11 16:32:41 +01:00
Joshua Moerman
0b046ca73f Wrote a simpler data structure for the observation table. However, it is slower 2020-11-10 15:11:26 +01:00
Joshua Moerman
8a66ccaec5 Rewrote nominal NL* for better performance, by specialising for Booleans 2020-08-14 20:13:01 +02:00
Joshua Moerman
5f5b35bbc8 Made NLStar simpler and 3x as fast 2020-05-29 10:26:54 +02:00
Joshua Moerman
a3e6d0581c simpler benchmarks 2020-05-28 09:21:42 +02:00
Joshua Moerman
16b0f6ed79 Cleaned up the cabal file and moved some bits around 2020-05-27 18:37:53 +02:00
Joshua Moerman
d6173c4381 some cleanup 2020-05-25 17:22:34 +02:00
Joshua Moerman
2f88417749 Adds more example on residual languages 2020-05-25 17:22:27 +02:00
Joshua Moerman
df7a45fb69 Added feature to start with a bigger table 2020-05-25 16:38:46 +02:00
Joshua Moerman
56ad54ecb0 Fixes bug that NL* may return sink states 2020-05-25 16:33:03 +02:00
Joshua Moerman
96ae5ba868 Forgot to add the new Main2.hs file :-( 2017-10-24 14:31:05 +02:00
Joshua Moerman
e91859b61f Updates README accordingly 2017-10-21 10:45:23 +02:00
Joshua Moerman
7da6db27b3 Two things: Optimisations (now only adds one row to fix closedness, and one column to fix inconsistencies) and IO (now also speaks the protocol used in the new paper) 2017-10-21 10:40:59 +02:00
Joshua Moerman
7b062904d8 Updates the README 2017-03-30 14:19:05 +01:00
Joshua Moerman
b05d958666 Updates it to use the new nlambda (with better support for generics). 2017-03-30 13:57:53 +01:00
Joshua Moerman
2d1d5d7bfd Generalizes external Teacher. Uses read-atoms branch from NLambda. 2016-12-05 14:47:41 +01:00
Joshua Moerman
3cc387a068 Splits the Teacher.hs into more files 2016-12-05 12:35:19 +01:00
Joshua Moerman
e475c5b471 Removed some debug IO 2016-12-02 16:10:40 +01:00
Joshua Moerman
15a02c4762 Uses the new NLambda features for an external teacher 2016-12-02 15:49:48 +01:00
Michał Szynwelski
e1b00e192b NLambda paragraph 2016-10-09 21:30:33 +02:00
Joshua Moerman
b7d48030f0 Prepared a bundles artifact for evaluation 2016-10-07 11:47:56 +02:00
Joshua Moerman
2ebd8b9774 Made code anonymous 
Also removed some vague comments
 2016-07-06 21:26:03 +02:00
Joshua Moerman
3de97f93c6 Main.hs now read arguments 2016-07-04 15:30:00 +02:00
Michał Szynwelski
5f51951b0d Optimization of size and maxSize functions. 2016-07-03 18:17:44 +02:00
Joshua Moerman
8d54c1a553 Adds better support for counter membership queries 
VERY EXPERIMENTAL AND SLOW
 2016-06-30 11:44:25 +02:00
Joshua Moerman
6337defa0e Adds a counter to the teacher (bery hacky) 2016-06-30 10:58:32 +02:00
Joshua Moerman
28145815c6 Improves performance by using more simplify 2016-06-28 12:08:10 +02:00
Joshua Moerman
8946bc941e Adds the examples from the paper 2016-06-28 10:35:12 +02:00
Joshua Moerman
a10c1cb84a Simplifies my own naive take on NL* 2016-06-27 14:51:36 +02:00
Joshua Moerman
8998042874 Adds a teacher for NFAs (bounded to a depth). 
Also includes a variation of the up-to technique found in the 'hacking
non-determinism' paper by Bonchi and Pous.
 2016-06-27 14:50:57 +02:00
Michał Szynwelski
a9b3738cd3 Optimization of consistencyTestDirect.candidates function. 2016-06-26 21:06:18 +02:00
Joshua Moerman
ec5fe35c79 Simplified consistency in Angluin 2016-06-24 13:57:17 +02:00
Joshua Moerman
7109eb1ec6 Improved the Bollig implementation 2016-06-24 10:41:00 +02:00
Joshua Moerman
e65a099948 Fixes a bug in my Bollig implementation 2016-06-23 17:16:02 +02:00
Joshua Moerman
9ac25c4d9b Refactors code to be more modular. 
Now all three variations: Angluin, Bollig and homebrew NL* are using the
same framework. I did not extensively test the refactor.
 2016-06-23 16:20:33 +02:00
Joshua Moerman
f24ed31ac8 Implemented NL* by Bollig et al (verbatim) 2016-06-23 14:50:30 +02:00
Joshua Moerman
25d47a3550 Refactors the IO monad out. Made functions pure again. 2016-06-23 11:16:47 +02:00
Joshua Moerman
f5f88a2ef7 Adds the NFA example by Bollig et al 2016-06-23 11:16:01 +02:00
Joshua Moerman
43c85612bb Refactors the code to use simpler types. 2016-06-22 17:30:26 +02:00