coli-saar / alto

Alto, the Algebraic Language Toolkit
Other
16 stars 2 forks source link

Check Stability of TreeAutomaton.getWeightRaw with bottom up non-determinism #13

Open akoehn opened 8 years ago

akoehn commented 8 years ago

Original report by Christoph Teichmann (Bitbucket: cteichmann, GitHub: CTNLP).


The getWeightRaw method creates a pair for every state and weight that it finds bottom up, but when multiple state combinations create the same parent state, then this should lead to multiple pairs, that could be summed up, this might lead to exponential behaviour for certain trees and automata.