Teaching push-down automata and Turing machines

dc.contributor.author	García-Osorio, César
dc.contributor.author	Mediavilla-Sáiz, Iñigo
dc.contributor.author	Jimeno-Visitación, Javier
dc.contributor.author	García-Pedrajas, Nicolás
dc.date.accessioned	2014-02-27T11:04:20Z
dc.date.available	2014-02-27T11:04:20Z
dc.date.issued	2014-02-27
dc.identifier.uri	http://hdl.handle.net/10396/11870
dc.description.abstract	In this paper we present the new version of a tool to assist in teaching formal languages and automata theory. In the previous version the tool provided algorithms for regular expressions, finite automata and context free grammars. The new version can simulate as well push-down automata and Turing machines	es_ES
dc.format.mimetype	application/pdf	es_ES
dc.language.iso	eng	es_ES
dc.rights	https://creativecommons.org/licenses/by-nc-nd/4.0/	es_ES
dc.source	En: ITiCSE’08, June 30–July 2, 2008, Madrid, Spain.	es_ES
dc.subject	Finite automaton	es_ES
dc.subject	Regular expression	es_ES
dc.subject	Cocke-Younger-Kasami algorithm	es_ES
dc.subject	Chomsky normal form	es_ES
dc.subject	LL parsing	es_ES
dc.subject	Interactive teaching tool	es_ES
dc.title	Teaching push-down automata and Turing machines	es_ES
dc.type	info:eu-repo/semantics/conferenceObject	es_ES
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es_ES