architecture

2018-02-21T04:09:56.000069Z

Contrasting that with another lib: https://github.com/cdorrat/reduce-fsm Which seems to make returning to states a bit more explicit (not sure if thats better or worse).

Ivan 2018-02-21T09:23:01.000319Z

@drewverlee you never "return" to "previous" states

Ivan 2018-02-21T09:23:24.000359Z

you at state 'x' and the allowed transitions are 'y' and 'z'

Ivan 2018-02-21T09:23:41.000238Z

if you are in a cycle, there is no ordering

Ivan 2018-02-21T09:23:46.000487Z

you always move forward

Ivan 2018-02-21T09:24:30.000406Z

the only exceptions are the entry point and the end/final state

2018-02-21T13:20:56.000062Z

@ivan.kanak_clojurians maybe i’m using the wrong terminology, if you look at the graph above i’m not sure how else to describe :error taking someone to 0. I think its probably correct to say its not the same ‘state’.

Ivan 2018-02-21T13:47:26.000224Z

Going from (2) to (0) is a move forward, even if it feels like (0) is "before" (1). It is not "before", but a prerequisite state to get to (1). You never go backwards, you never take back the fact that you got to (2) through (1). You are always progressing, and the progressions happen by choosing one of the available/valid transitions. Following the transitions you always move forward.

john 2018-02-21T15:15:05.000790Z

Pushdown automata have local state you can bang on, sorta