
- Barwise, J. and J. Etchemendy, "Turing's World: A Computer-Based Introduction to Computability Theory." Kinko's Academic Courseware Exchange, Santa Barbara, CA 1986.]] Google Scholar
Digital Library
- Hannay, D., "Hypercard Automata Simulation: Finite-State, Pushdown and Turing Machines," SIGCSE Bulletin 24(2),55(1992).]] Google Scholar
Digital Library
Index Terms
Finite state machine simulation in an introductory lab
Recommendations
Synthesis of Testable Finite State Machine Through Decomposition
ATS '05: Proceedings of the 14th Asian Test Symposium on Asian Test SymposiumThis paper reports an efficient state encoding scheme for synthesis of large FSMs with enhanced BIST quality. A metric, referred to as degree-of-freedom (DOF) [5] in FSM states has been employed to quantify the BIST quality. Analysis of DOF enables ...
Automated Finite State Machine Extraction
FEAST'19: Proceedings of the 3rd ACM Workshop on Forming an Ecosystem Around Software TransformationFinite state machine (FSM) is a type of computation models widely used in various software programs. Extracting implemented FSMs has many important applications in the networking, software engineering and security domains. In this paper, we first ...
Canonical finite state machines for distributed systems
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multiple ports/interfaces a multi-port FSM is used and in testing, a tester is ...






Comments