Article

Free access

A collection of tools for making automata theory and formal languages come alive

Authors:

Edwin TsangAuthors Info & Claims

SIGCSE '97: Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education

Pages 15 - 19

https://doi.org/10.1145/268084.268089

Published: 01 March 1997 Publication History

PDF eReader

Abstract

We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating and simulating finite automata, pushdown automata and Turing machines; Pâté for parsing restricted and unrestricted grammars and transforming context-free grammars to Chomsky Normal Form; and PumpLemma for proving specific languages are not regular. Enhancements to previous tools LLparse and LRparse, instructional tools for parsing LL(1) and LR(1) grammars, include parsing LL(2) grammars, displaying parse trees, and parsing any context-free grammar with conflict resolution.

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 andJ. Etchemedy, Turing's World, Stanford: CSLI Publications, New York: Cambridge University Press, 1993.

Google Scholar

[3]

S. Blythe, M. James, S. Rodger, LLparse and LRparse: Visual and Interactive Tools for Parsing, Twenty-fifth SIGCSE Technical Symposium on Computer Science Education, p. 208-212, 1994.

Digital Library

Google Scholar

[4]

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

[5]

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

Crossref

Google Scholar

[6]

D. Hannay, Hypercard Automata Simulation: Finite State, Pushdown and Turing Machines, SIGCSE Bulletin, 24, 2, p. 55-58, June 1992.

Digital Library

Google Scholar

[7]

M. LoSacco, and S. Rodger, FLAP: A Tool for Drawing and Simulating Automata, ED-MEDIA 93, World Conference on Educational Multimedia and Hypermedia, p. 310-317, June 1993.

Google Scholar

[8]

S. Rodger, An Interactive Lecture Approach to Teaching Computer Science, Proceedings of the Twenty-sixth SIGCSE Technical Symposium on Computer Science Education, p.278-282, 1995.

Digital Library

Google Scholar

[9]

S. Rodger, Integrating Hands-On Work into the Formal Languages Course via Tools and Programming, First International Workshop on Implementing Automata, London, Ontario, 1996, (to appear).

Digital Library

Google Scholar

[10]

M. Proeopiue, O. Procopiue, and S. Rodger, "Visualization and Interaction in the Computer Science Forreal Languages Course with JFLAP" 1996 Frontiers in Education Conference, Salt Lake City, Utah, 1996, (to appear).

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

[12]

K. Sutner, Implementing Finite State Machines, in Computational Support for Discrete Mathematics, D1- MACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 15, N. Dean and G. E. Shannon (ed.), American Mathematical Society, p. 347-363, 1992.

Google Scholar

Cited By

View all

Xu CDuan YZhang C(2023)Formal Management-Specifying Approach for Model-Based Safety AssessmentJournal of Systems Engineering and Electronics10.23919/JSEE.2023.00015434:6(1589-1601)Online publication date: Dec-2023
https://doi.org/10.23919/JSEE.2023.000154
Tanveer MGupta TShah M(2021)Pinball Loss Twin Support Vector ClusteringACM Transactions on Multimedia Computing, Communications, and Applications10.1145/340926417:2s(1-23)Online publication date: 21-Jun-2021
https://dl.acm.org/doi/10.1145/3409264
Wolf C(2020)Democratizing AI?XRDS: Crossroads, The ACM Magazine for Students10.1145/339837026:4(12-15)Online publication date: 9-Jul-2020
https://dl.acm.org/doi/10.1145/3398370
Show More Cited By

Index Terms

A collection of tools for making automata theory and formal languages come alive

Recommendations

A collection of tools for making automata theory and formal languages come alive

We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating and simulating finite automata, pushdown automata and Turing machines; P&...
Formal languages and their relation to automata
Learning automata and formal languages interactively with JFLAP
ITICSE '06: Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGCSE '97: Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education

March 1997

410 pages

ISBN:0897918894

DOI:10.1145/268084

Chairmen:
Curt M. White
Rosary College, River forest, IL
,
Carl Erickson
Grand Valley State Univ., Allendale MI
,
Bruce Klein
Grand Valley State Univ., Allendale, MI
,
Editor:
James E. Miller
Univ. of Southern Mississippi, Hattiesburg

ACM SIGCSE Bulletin Volume 29, Issue 1
March 1997
388 pages
ISSN:0097-8418
DOI:10.1145/268085
Issue’s Table of Contents

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 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCSE97

Sponsor:

SIGCSE

SIGCSE97: 28th SIGCSE Technical Symposium on Computer Science Education

February 27 - March 1, 1997

California, San Jose, USA

Acceptance Rates

SIGCSE '97 Paper Acceptance Rate 75 of 177 submissions, 42%;

Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

Upcoming Conference

SIGCSE Virtual 2024

Sponsor:
sigcse

1st ACM Virtual Global Computing Education Conference

December 5 - 8, 2024

Virtual Event , NC , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

68
Total Citations
View Citations
899
Total Downloads

Downloads (Last 12 months)168
Downloads (Last 6 weeks)20

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xu CDuan YZhang C(2023)Formal Management-Specifying Approach for Model-Based Safety AssessmentJournal of Systems Engineering and Electronics10.23919/JSEE.2023.00015434:6(1589-1601)Online publication date: Dec-2023
https://doi.org/10.23919/JSEE.2023.000154
Tanveer MGupta TShah M(2021)Pinball Loss Twin Support Vector ClusteringACM Transactions on Multimedia Computing, Communications, and Applications10.1145/340926417:2s(1-23)Online publication date: 21-Jun-2021
https://dl.acm.org/doi/10.1145/3409264
Wolf C(2020)Democratizing AI?XRDS: Crossroads, The ACM Magazine for Students10.1145/339837026:4(12-15)Online publication date: 9-Jul-2020
https://dl.acm.org/doi/10.1145/3398370
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
Stute MKreitschmann DHollick M(2019)Reverse Engineering and Evaluating the Apple Wireless Direct Link ProtocolGetMobile: Mobile Computing and Communications10.1145/3351422.335143223:1(30-33)Online publication date: 24-Jul-2019
https://dl.acm.org/doi/10.1145/3351422.3351432
Moradi MSundaresan KChai ERangarajan SMao Z(2019)SkycoreGetMobile: Mobile Computing and Communications10.1145/3351422.335143123:1(24-29)Online publication date: 24-Jul-2019
https://dl.acm.org/doi/10.1145/3351422.3351431
Wang JAbari OKeshav S(2019)RFID Hacking for Fun and ProfitGetMobile: Mobile Computing and Communications10.1145/3351422.335143023:1(21-23)Online publication date: 24-Jul-2019
https://dl.acm.org/doi/10.1145/3351422.3351430
Misra PVasan AKrishnan BRaghavan VSivasubramaniam A(2019)The Future of Smart Parking Systems with Parking 4.0GetMobile: Mobile Computing and Communications10.1145/3351422.335142623:1(10-15)Online publication date: 24-Jul-2019
https://dl.acm.org/doi/10.1145/3351422.3351426
Guin UAsadizanjani NTehranipoor M(2019)Standards for Hardware SecurityGetMobile: Mobile Computing and Communications10.1145/3351422.335142423:1(5-9)Online publication date: 24-Jul-2019
https://dl.acm.org/doi/10.1145/3351422.3351424
Chen HLi JGao JSun YHu YYin B(2019)Maximally Correlated Principal Component Analysis Based on Deep Parameterization LearningACM Transactions on Knowledge Discovery from Data10.1145/333218313:4(1-17)Online publication date: 29-Jul-2019
https://dl.acm.org/doi/10.1145/3332183
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

A collection of tools for making automata theory and formal languages come alive

Formal languages and their relation to automata

Learning automata and formal languages interactively with JFLAP