ACM Home Page
Please provide us with feedback. Feedback
Increasing visualization and interaction in the automata theory course
Full text PdfPdf (1.12 MB)
Source Technical Symposium on Computer Science Education archive
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education table of contents
Austin, Texas, United States
Pages: 6 - 10  
Year of Publication: 2000
ISBN:1-58113-213-1
Also published in ...
Authors
Ted Hung  Computer Science Department, Duke University, Durham, NC
Susan H. Rodger  Computer Science Department, Duke University, Durham, NC
Sponsor
SIGCSE: ACM Special Interest Group on Computer Science Education
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/330908.331800
What is a DOI?

ABSTRACT

In this paper we describe how to increase the visualization and interaction in the automata theory course through the use of the tools JFLAP and Pâté. We also describe new features in these tools that allow additional visualization and interaction. New features in JFLAP include the addition of regular expressions and exploring their conversion from and to nondeterministic finite automata (NFA), and increasing the interaction in the conversion of automata to grammars. New features in Pâté include the display of a parse tree while parsing unrestricted grammars, and improved interaction with parsing and the transformation of grammars.



CITED BY  15

Collaborative Colleagues:
Ted Hung: colleagues
Susan H. Rodger: colleagues