joshua/monoid-learner
1
Fork 0
mirror of https://github.com/Jaxan/monoid-learner.git synced 2025-04-27 15:07:45 +02:00
Code Issues Releases Activity
Learns a monoid with an L*-like algorithm
3 commits 1 branch 0 tags 38 KiB
Find a file
Joshua Moerman ecfc02c1c5 Added example output
2021-03-12 10:13:45 +01:00
app Working implementation 2021-03-12 09:53:24 +01:00
src Working implementation 2021-03-12 09:53:24 +01:00
.gitignore Working implementation 2021-03-12 09:53:24 +01:00
monoid-learner.cabal Working implementation 2021-03-12 09:53:24 +01:00
README.md Added example output 2021-03-12 10:13:45 +01:00
Setup.hs Working implementation 2021-03-12 09:53:24 +01:00

README.md

monoid-learner

Learns the minimal monoid accepting an unknown language through an orcale. Similar to Lstar, but for monoids instead of automata. The output is a monoid representation which is furthermore minimised by the Knuth-Bendix completion.

Original

Output for the example in app/Main.hs:

Inferred rules: (generators are a, b and the unit)
[(fromList "aaa",fromList "a"),(fromList "aaaa",fromList "aa"),(fromList "aaab",fromList "ab"),(fromList "aaabb",fromList "abb"),(fromList "aab",fromList "b"),(fromList "aabb",fromList "bb"),(fromList "aba",fromList "b"),(fromList "abaa",fromList "ab"),(fromList "abab",fromList "bb"),(fromList "ababb",fromList "aa"),(fromList "abba",fromList "bb"),(fromList "abbaa",fromList "abb"),(fromList "abbab",fromList "aa"),(fromList "abbabb",fromList "b"),(fromList "abbb",fromList "a"),(fromList "abbbb",fromList "ab"),(fromList "ba",fromList "ab"),(fromList "baa",fromList "b"),(fromList "bab",fromList "abb"),(fromList "babb",fromList "a"),(fromList "bba",fromList "abb"),(fromList "bbaa",fromList "bb"),(fromList "bbab",fromList "a"),(fromList "bbabb",fromList "ab"),(fromList "bbb",fromList "aa"),(fromList "bbbb",fromList "b")]
After KB:
[(fromList "ba",fromList "ab"),(fromList "aaa",fromList "a"),(fromList "aab",fromList "b"),(fromList "bbb",fromList "aa")]