A Simplified Representation of Finite State Machines by Generic States
Mikael Fridenfalk · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 2014
Wildcards are of significant value for the simplification of state diagrams and truth tables for the representation of finite state machines. In this paper a new type of wildcard is introduced, called a generic state, which without any loss of information may further simplify such representations.