1 research outputs found
Teaching push-down automata and Turing machines
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 machine