Re:Buttons as Finite Automata
by NoWizards on Thursday March 24, 2022 @08:00PM
(#30797132)
Is there a (mathematical if possible) way, using FSMs, to demonstrate if a specific case or behavior can or can't be implemented.
[ Parent
| on HN ]
Yes there is. You may want to look into Deterministic and Non-Deterministic Finite Automata. They are foundational to computability and Turing machines.
https://en.wikipedia.org/wiki/Deterministic_finite_automaton...
You are designing a "prefix code".
It is a collection of strings of button presses
such as {A, BA, BBAA, BBABA, BBB, ...}.
Each string maps to an action.
Ideally no string is a prefix of another string. Even more ideally any infinite sequence of As and Bs can be decoded into a sequence of actions.