Opened this issue 10 years ago · 1 comments
Very rarely, the algorithm finds pA that aren't -- they are reducible.
Toby's comment makes it sound like if we can find the train track map (#3), we could find the gates. Or maybe finding the gates is simpler than the full map?