Teaching push-down automata and Turing machines
Autor
García-Osorio, César
Mediavilla-Sáiz, Iñigo
Jimeno-Visitación, Javier
García-Pedrajas, Nicolás
Fecha
2014-02-27Materia
Finite automatonRegular expression
Cocke-Younger-Kasami algorithm
Chomsky normal form
LL parsing
Interactive teaching tool
METS:
Mostrar el registro METSPREMIS:
Mostrar el registro PREMISMetadatos
Mostrar el registro completo del ítemResumen
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