10 commits

Author	SHA1	Message	Date
Joshua Moerman	2f88417749	Adds more example on residual languages	2020-05-25 17:22:27 +02: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	8946bc941e	Adds the examples from the paper	2016-06-28 10:35:12 +02:00
Joshua Moerman	f5f88a2ef7	Adds the NFA example by Bollig et al	2016-06-23 11:16:01 +02:00
Joshua Moerman	9ee755117e	Adds ways to control strictness. ... Increases efficiency by 1.5x (if used in observation table)	2016-06-22 17:27:35 +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
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