14 commits

Author	SHA1	Message	Date
Joshua Moerman	15a02c4762	Uses the new NLambda features for an external teacher	2016-12-02 15:49:48 +01:00
Joshua Moerman	3de97f93c6	Main.hs now read arguments	2016-07-04 15:30:00 +02:00
Joshua Moerman	6337defa0e	Adds a counter to the teacher (bery hacky)	2016-06-30 10:58:32 +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	43c85612bb	Refactors the code to use simpler types.	2016-06-22 17:30:26 +02:00
Joshua Moerman	24e2c1ff88	Hacked NL* together. ... Not complete yet, but it already works for the prototypical NFA: all words with duplicate atoms.	2016-06-20 16:40:08 +02:00
Michał Szynwelski	fbcba8c580	Optimization of incompleteness function.	2016-06-17 14:12:09 +02:00
Joshua Moerman	e403d7dbd6	Adds definition for inconsistency by Bartek	2016-06-17 08:57:15 +02:00
Joshua Moerman	7c0cdcf7c3	Code: Implemented adding CEs as columns (Rivest Schapire variant?)	2016-04-28 17:47:51 +01:00
Joshua Moerman	004e71ccd9	Code: some cleanup	2016-04-28 17:26:16 +01:00
Michał Szynwelski	440e5ef854	Formula simplifications + constants.	2016-04-24 23:15:07 +02:00
Joshua Moerman	d52f991a74	Code: Angluin's algorithm with NLambda	2016-04-14 17:36:03 +01:00