Change search
ReferencesLink to record
Permanent link

Direct link
A Simplified Representation of Finite State Machines by Generic States
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Game Design.
2014 (English)In: Nicograph International 2014, 2014, 163-164 p.Conference paper (Refereed)
Abstract [en]

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.
Keyword [en]
finite state machine; minimization; sequential automata; simplification; state diagram; truth table; wildcard
National Category
Computer Systems
Research subject
Computer Science
URN: urn:nbn:se:uu:diva-235501OAI: diva2:761624
Nicograph International 2014, Visby, Sweden, May 2014
Available from: 2014-11-07 Created: 2014-11-05 Last updated: 2014-11-11Bibliographically approved

Open Access in DiVA

fulltext(333 kB)85 downloads
File information
File name FULLTEXT02.pdfFile size 333 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Fridenfalk, Mikael
By organisation
Department of Game Design
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 85 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 240 hits
ReferencesLink to record
Permanent link

Direct link