Fix function convertToTuringMachine

Author: SergeyKuz1001

src/DebuggingTMTypes.hs

@@ -3,6 +3,7 @@
 module DebuggingTMTypes where
 
 import TuringMachine
+import TuringMachine.Optimization
 import GrammarType
 
 import Control.Monad (forM)
@@ -48,7 +49,7 @@ convertToTuringMachine tm@(DTM (DQuadruples quadruplesMap)) = do
                     D symbol2 -> S <$> symbols' !? symbol2
             qt <- states'  !? state2
             return ((qf, s), (sm, qt))
-    return $ turingMachine (fromList quadruplesList) emptyC alphabet'
+    return $ safeOptimize O1 $ turingMachine (fromList quadruplesList) emptyC alphabet'
 
 getStates :: DebuggingTuringMachine -> IsoMap DebuggingState State
 getStates (DTM (DQuadruples qdrs)) = let

src/TM2SP.hs

@@ -12,6 +12,7 @@ import TM2SP.Generators
 import TM2SP.Relations
 import TuringMachine
 import qualified SemigroupPresentation as SP
+import ShowInfo
 
 tm2sp ::
     MonadFail m =>
@@ -78,6 +79,11 @@ semigroupGamma =
 
 newtype SemigroupPresentation_1 = SP1 { unSP1 :: SP.SemigroupPresentation }
 
+instance ShowInfo (SemigroupPresentation_1) where
+    showTitle = const $ Title "Semigroup Presentation"
+    showInfo (SP1 sp) = showInfo sp
+    showListTitle = const $ Title "List of Semigroup Presentations"
+
 semigroupGamma_1 :: MonadFail m => TuringMachine -> m SemigroupPresentation_1
 semigroupGamma_1 =
     (fmap.fmap) SP1 $ tm2sp [

src/TuringMachine/Interpreter.hs

@@ -8,6 +8,7 @@ module TuringMachine.Interpreter (
     initWS,
     run,
     smartRun,
+    superSmartRun,
     module TuringMachine.Interpreter.Tape,
     module TuringMachine,
   ) where
@@ -58,3 +59,21 @@ smartRun tm ws =
             if qf == qt && S s == sm
             then [ws, ws']
             else ws : smartRun tm ws'
+
+superSmartRun ::
+    MonadFail m =>
+    TuringMachine ->
+    WorkingState ->
+    m [WorkingState]
+superSmartRun tm ws =
+    case step tm ws of
+        Nothing ->
+            if ws^.currentState == finalState
+            then return [ws]
+            else fail "Can't find step from non-final state"
+        Just (((qf, s), (sm, qt)), ws') ->
+            if qf == qt && S s == sm
+            then return [ws, ws']
+            else do
+                wss <- superSmartRun tm ws'
+                return (ws : wss)