T-Flet/Graph-State-Machine

A simple framework for building an easily interpretable computational construct somewhere between a graph automaton and a Turing machine, where states are combinations of (typed) nodes; an example use would be as transparent backend logic by pathing through an ontology.

PythonBSD-3-Clause