Please use this identifier to cite or link to this item: http://dspace.cas.upm.edu.ph:8080/xmlui/handle/123456789/3563
Title: Simulation of Deterministic Turing Machine With and Without Storage
Authors: Young, Genevieve D.
Keywords: simulation
turing machine
storage automata
language theory
simulator software
transition diagram
Issue Date: Apr-2003
Abstract: Automata and Language Theory is a core course in Computer Science. The course presents theoretical models of computations, and one of them is the Turing machine. Construction of Turing machines is often tedious, and conceptualization of their behavior is difficult. A web-accessible simulator software is developed to provide a means of analyzing the behavior of a machine graphically. This simulator provides graphical simulations of the tape and the transition diagram. The software can simulate deterministic Turing machines (without storage) and a special type of Turing machine that has storage in the finite control.
URI: http://dspace.cas.upm.edu.ph:8080/xmlui/handle/123456789/3563
Appears in Collections:BS Computer Science SP

Files in This Item:
File Description SizeFormat 
2003_Young GD_Simulation of Deterministic Turing Machine With and Without Storage.pdf
  Until 9999-01-01
6.86 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.