A Simplified Representation of Finite State Machines by Generic States
2014 (English)In: Nicograph International 2014, 2014, 163-164 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
2014. 163-164 p.
finite state machine; minimization; sequential automata; simplification; state diagram; truth table; wildcard
Research subject Computer Science
IdentifiersURN: urn:nbn:se:uu:diva-235501OAI: oai:DiVA.org:uu-235501DiVA: diva2:761624
Nicograph International 2014, Visby, Sweden, May 2014