Simulation of Deterministic Turing Machine With and Without Storage

Please use this identifier to cite or link to this item: http://dspace.cas.upm.edu.ph:8080/xmlui/handle/123456789/3563

Full metadata record

DC Field	Value	Language
dc.contributor.author	Young, Genevieve D.	-
dc.date.accessioned	2026-03-10T01:35:26Z	-
dc.date.available	2026-03-10T01:35:26Z	-
dc.date.issued	2003-04	-
dc.identifier.uri	http://dspace.cas.upm.edu.ph:8080/xmlui/handle/123456789/3563	-
dc.description.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.	en_US
dc.subject	simulation	en_US
dc.subject	turing machine	en_US
dc.subject	storage automata	en_US
dc.subject	language theory	en_US
dc.subject	simulator software	en_US
dc.subject	transition diagram	en_US
dc.title	Simulation of Deterministic Turing Machine With and Without Storage	en_US
dc.type	Thesis	en_US
Appears in Collections:	BS Computer Science SP

Files in This Item:

File	Description	Size	Format
2003_Young GD_Simulation of Deterministic Turing Machine With and Without Storage.pdf Until 9999-01-01		6.86 MB	Adobe PDF	View/Open Request a copy

DSpace JSPUI