• loafty_loafey@lemmy.world
    link
    fedilink
    arrow-up
    3
    ·
    1 year ago

    You are probably thinking of Temporal logic which allows us to model if algorithms and programs terminate etc! It can be represented by using state machines tho!

    • Prunebutt@feddit.de
      link
      fedilink
      arrow-up
      2
      ·
      1 year ago

      It’s been a while, so I’m quite rusty, especiallyeon the terminology, but I think we modelled feasible sequences of finite and infinite state machines using regexes.

      That’s how I was forced to learn 'em in uni. ;)

      • loafty_loafey@lemmy.world
        link
        fedilink
        arrow-up
        2
        ·
        1 year ago

        Ohhh I must be confusing the two! But yea, Regex is just NDAs in text form! The course I have had on it is one of my favorites! Really fun stuff