article

Free access

Using JFLAP to interact with theorems in automata theory

Authors:

Eric Gramond,

Susan H. RodgerAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 31, Issue 1

Pages 336 - 340

https://doi.org/10.1145/384266.299800

Published: 01 March 1999 Publication History

PDF eReader

Abstract

An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback in CPS 140, our automata theory course. JFLAP is a tool for designing and running nondeterministic versions of finite automata, pushdown automata, and Turing machines. Recently, we have enhanced JFLAP to allow one to study the proofs of several theorems that focus on conversions of languages, from one form to another, such as converting an NFA to a DFA and then to a minimum state DFA. In addition, our enhancements combined with other tools allow one to interactively study LL and LR parsing methods.

References

[1]

A. Badre, C. Lewis, and J. Stasko, Empirically Evaluating the Use of Animations to Teach Algorithms, Proceedings of the 1994 IEEE Symposium on Visual Languages, p. 48-54, 1994.

Google Scholar

[2]

J. Barwise and J. Etchemendy, Turing's World 3.0 - An Introduction to Computability Theory, 1993.

Digital Library

Google Scholar

[3]

A. O. Bilska, K. H. Leider, M. Procopiuc, O. Procopiuc, S. H. Rodger, J. R. Salemme and E. Tsang, A Collection of Tools for Making Automata Theory and Formal Languages Come Alive, Twenty-eighth SIGCSE Technical Symposium on Computer Science Education, p. 15-19, 1997.

Digital Library

Google Scholar

[4]

C. Boroni, E Goosey, M. Grinder, R. Ross and P. Wissenbach, WebLab! A Universal and Interactive Teaching, Learning, and Laboratory Environment for the World Wide Web, Twenty-eighth SIGCSE Technical Symposium on Computer Science Education, p. 199- 203, 1997.

Digital Library

Google Scholar

[5]

M. Brown, ZEUS: A System for algorithm animation and multi-view editing. Proceedings of the IEEE 1991 Workshop on Visual Languages, p. 4-9, Kobe, Japan, Oct. 1991.

Crossref

Google Scholar

[6]

P. Gloor, AACE - Algorithm Animation for Computer Science Education, IEEE Workshop on Visual Languages, p. 25-31, 1992.

Crossref

Google Scholar

[7]

H. Lewis, C. Papadimitriou, Elements of the Theory of Computation, Second Edition, Prentice Hall, 1998.

Digital Library

Google Scholar

[8]

P. Linz, An Introduction to Formal Languages and Automata, Second Edition, D. C. Heath and Company, 1996.

Digital Library

Google Scholar

[9]

W. Pierson and S. H. Rodger, Web-based Animations Of Data Structures Using JAWAA, Twenty-ninth SIGCSE Technical Symposium on Computer Science Education, p. 267-271, 1998.

Digital Library

Google Scholar

[10]

M. Procopiuc, O. Procopiuc, and S. Rodger, Visualization and Interaction in the Computer Science Formal Languages Course with JFLAP, 1996 Frontiers in Education Conference, Salt Lake City, Utah, p. 121-125, 1996.

Digital Library

Google Scholar

[11]

J. Stasko, Tango: A Framework and System for Algorithm Animation, IEEE Computer, p.27-39, September 1990.

Digital Library

Google Scholar

Cited By

View all

Cabarle F(2024)Thinking about spiking neural P systems: some theories, tools, and research topicsJournal of Membrane Computing10.1007/s41965-024-00147-y6:2(148-167)Online publication date: 29-Apr-2024
https://doi.org/10.1007/s41965-024-00147-y
Jovanović NMiljković DStamenković SJovanović ZChakraborty P(2020)Teaching concepts related to finite automata using ComVisComputer Applications in Engineering Education10.1002/cae.2235329:5(994-1006)Online publication date: 19-Oct-2020
https://doi.org/10.1002/cae.22353
Ade-Ibijola A(2018)Synthesis of regular expression problems and solutionsInternational Journal of Computers and Applications10.1080/1206212X.2018.148239842:8(748-764)Online publication date: 28-Jun-2018
https://doi.org/10.1080/1206212X.2018.1482398
Show More Cited By

Index Terms

Using JFLAP to interact with theorems in automata theory
1. Applied computing
  1. Education
2. Social and professional topics
  1. Professional topics
    1. Computing education

Recommendations

Using JFLAP to interact with theorems in automata theory
SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science education

An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback in CPS 140, our automata theory course. JFLAP is a tool for designing and ...
A Learning Algorithm for Deterministic Finite Automata using JFLAP

The JFLAP package is a free, interactive visualization, and teaching tool for formal languages. JFLAP is based on the principle that a picture of a concept can be easier to understand than a textual representation. With the help of this package, we ...
On stateless multihead automata: Hierarchies and the emptiness problem

We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGCSE Bulletin Volume 31, Issue 1

March 1999

370 pages

ISSN:0097-8418

DOI:10.1145/384266

Editor:
John Impagliazzo
Hofstra Univ., Hempstead, NY

Issue’s Table of Contents

SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
March 1999
383 pages
ISBN:1581130856
DOI:10.1145/299649
Chairmen:
Jane Prey
Univ. of Virginia, Charlottesville
,
Bob Noonan
College of William & Mary, Williamsburg, VA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1999

Published in SIGCSE Volume 31, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
670
Total Downloads

Downloads (Last 12 months)136
Downloads (Last 6 weeks)28

Reflects downloads up to 30 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cabarle F(2024)Thinking about spiking neural P systems: some theories, tools, and research topicsJournal of Membrane Computing10.1007/s41965-024-00147-y6:2(148-167)Online publication date: 29-Apr-2024
https://doi.org/10.1007/s41965-024-00147-y
Jovanović NMiljković DStamenković SJovanović ZChakraborty P(2020)Teaching concepts related to finite automata using ComVisComputer Applications in Engineering Education10.1002/cae.2235329:5(994-1006)Online publication date: 19-Oct-2020
https://doi.org/10.1002/cae.22353
Ade-Ibijola A(2018)Synthesis of regular expression problems and solutionsInternational Journal of Computers and Applications10.1080/1206212X.2018.148239842:8(748-764)Online publication date: 28-Jun-2018
https://doi.org/10.1080/1206212X.2018.1482398
Pereira CTerra R(2018)A mobile app for teaching formal languages and automataComputer Applications in Engineering Education10.1002/cae.2194426:5(1742-1752)Online publication date: 28-Jun-2018
https://doi.org/10.1002/cae.21944
Chakraborty PSaxena PKatti C(2011)Fifty years of automata simulationACM Inroads10.1145/2038876.20388932:4(59-70)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1145/2038876.2038893
Sigman S(2007)Engaging students in formal language theory and theory of computationACM SIGCSE Bulletin10.1145/1227504.122746339:1(450-453)Online publication date: 7-Mar-2007
https://dl.acm.org/doi/10.1145/1227504.1227463
Sigman SRussell IHaller SDougherty JRodger S(2007)Engaging students in formal language theory and theory of computationProceedings of the 38th SIGCSE technical symposium on Computer science education10.1145/1227310.1227463(450-453)Online publication date: 7-Mar-2007
https://dl.acm.org/doi/10.1145/1227310.1227463
Verma R(2005)A visual and interactive automata theory course emphasizing breadth of automataACM SIGCSE Bulletin10.1145/1151954.106753537:3(325-329)Online publication date: 27-Jun-2005
https://dl.acm.org/doi/10.1145/1151954.1067535
Verma RCunha JFleischman WProulx VLourenço J(2005)A visual and interactive automata theory course emphasizing breadth of automataProceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education10.1145/1067445.1067535(325-329)Online publication date: 27-Jun-2005
https://dl.acm.org/doi/10.1145/1067445.1067535
Vieira LVieira MVieira NJoyce DKnox DDann WNaps T(2004)Language emulator, a helpful toolkit in the learning process of computer theoryProceedings of the 35th SIGCSE technical symposium on Computer science education10.1145/971300.971348(135-139)Online publication date: 3-Mar-2004
https://dl.acm.org/doi/10.1145/971300.971348
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations