Skip header Section
Skip Bibliometrics Section
JFLAP: An Interactive Formal Languages and Automata PackageFebruary 2006
- Author:
- Susan H. Rodger
Abstract
No abstract available.
Cited By
- Dey P and Badkoobehi H (2021). Mathematical foundations of computer science, Journal of Computing Sciences in Colleges, 37:2, (115-116), Online publication date: 1-Oct-2021.
- Dey P, Sinha B and Amin M (2021). Supporting asynchronous learners with multiple representations, Journal of Computing Sciences in Colleges, 36:2, (108-116), Online publication date: 1-Oct-2020.
MacCormick J (2020). Using computer programs and search problems for teaching theory of computation, Communications of the ACM, 63:10, (33-35), Online publication date: 23-Sep-2020.- Brown L, Feltz A and Wallace C Lab exercises for a discrete structures course: exploring logic and relational algebra with Alloy Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, (135-140)
- MacCormick J Strategies for Basing the CS Theory Course on Non-decision Problems Proceedings of the 49th ACM Technical Symposium on Computer Science Education, (521-526)
- Castro-Schez J, Gallardo J, Miguel R and Vallejo D (2017). Knowledge-based systems to enhance learning, Knowledge-Based Systems, 122:C, (180-198), Online publication date: 15-Apr-2017.
- Jain A, Goyal A and Chakraborty P (2017). PPVT, ACM Inroads, 8:1, (43-47), Online publication date: 17-Feb-2017.
- Rostami M and Bcker H (2015). Interactively Exploring the Connection between Bidirectional Compression and Star Bicoloring, Procedia Computer Science, 51:C, (1917-1926), Online publication date: 1-Sep-2015.
- D'antoni L, Kini D, Alur R, Gulwani S, Viswanathan M and Hartmann B (2015). How Can Automatic Feedback Help Students Construct Automata?, ACM Transactions on Computer-Human Interaction, 22:2, (1-24), Online publication date: 15-Apr-2015.
- Gulwani S (2014). Example-based learning in computer-aided STEM education, Communications of the ACM, 57:8, (70-80), Online publication date: 1-Aug-2014.
- Dey P, Amin M, Romney G, Sinha B, Gonzales R, Farahani A and Badkoobehi H (2012). Relating automata to other fields, Journal of Computing Sciences in Colleges, 27:4, (168-173), Online publication date: 1-Apr-2012.
- Crescenzi P, Rossi L and Apollaro G Making turing machines accessible to blind students Proceedings of the 43rd ACM technical symposium on Computer Science Education, (167-172)
- Raab M, Wernsdorfer M, Kitzelmann E and Schmid U From sensorimotor graphs to rules Proceedings of the 4th international conference on Artificial general intelligence, (333-339)
- Rodger S, Qin H and Su J Changes to JFLAP to increase its use in courses Proceedings of the 16th annual joint conference on Innovation and technology in computer science education, (339-339)
- Urquiza-Fuentes J, Manso F, Velázquez-Iturbide J and Rubio-Sánchez M Improving compilers education through symbol tables animations Proceedings of the 16th annual joint conference on Innovation and technology in computer science education, (203-207)
- Shaffer C, Akbar M, Alon A, Stewart M and Edwards S Getting algorithm visualizations into the classroom Proceedings of the 42nd ACM technical symposium on Computer science education, (129-134)
- Enström E and Kann V Computer lab work on theory Proceedings of the fifteenth annual conference on Innovation and technology in computer science education, (93-97)
- Chudá D and Rodina D Automata simulator Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies, (394-399)
- Alecha M and Hermo M (2009). A Learning Algorithm for Deterministic Finite Automata using JFLAP, Electronic Notes in Theoretical Computer Science (ENTCS), 248, (47-56), Online publication date: 1-Aug-2009.
- Rodger S, Wiebe E, Lee K, Morgan C, Omar K and Su J (2009). Increasing engagement in automata theory with JFLAP, ACM SIGCSE Bulletin, 41:1, (403-407), Online publication date: 4-Mar-2009.
- Rodger S, Wiebe E, Lee K, Morgan C, Omar K and Su J Increasing engagement in automata theory with JFLAP Proceedings of the 40th ACM technical symposium on Computer science education, (403-407)
- Rößling G, Joy M, Moreno A, Radenski A, Malmi L, Kerren A, Naps T, Ross R, Clancy M, Korhonen A, Oechsle R and Iturbide J (2008). Enhancing learning management systems to better support computer science education, ACM SIGCSE Bulletin, 40:4, (142-166), Online publication date: 30-Nov-2008.
- Stoughton A Experimenting with formal languages using forlan Proceedings of the 2008 international workshop on Functional and declarative programming in education, (41-50)
- Ross R (2008). Hypertextbooks and a Hypertextbook authoring environment, ACM SIGCSE Bulletin, 40:3, (133-137), Online publication date: 25-Aug-2008.
- Ross R Hypertextbooks and a Hypertextbook authoring environment Proceedings of the 13th annual conference on Innovation and technology in computer science education, (133-137)
- Jarvis J and Lucas J (2008). Understanding the Universal Turing Machine, Journal of Computing Sciences in Colleges, 23:5, (180-188), Online publication date: 1-May-2008.
- Lucas J and Jarvis J Incorporating transformations into jflap for enhanced understanding of automata Proceedings of the 39th SIGCSE technical symposium on Computer science education, (14-18)
- Lucas J and Jarvis J (2008). Incorporating transformations into jflap for enhanced understanding of automata, ACM SIGCSE Bulletin, 40:1, (14-18), Online publication date: 29-Feb-2008.
- Blanco Arbe J, Ortega A and Mártinez-Conde J (2007). Formal languages through web forms and regular expressions, ACM SIGCSE Bulletin, 39:4, (100-104), Online publication date: 1-Dec-2007.
- Ben-Ari M (2007). Teaching concurrency and nondeterminism with spin, ACM SIGCSE Bulletin, 39:3, (363-364), Online publication date: 25-Jun-2007.
- Rodger S, Lim J and Reading S (2007). Increasing interaction and support in the formal languages and automata theory course, ACM SIGCSE Bulletin, 39:3, (58-62), Online publication date: 25-Jun-2007.
- Stallmann M, Balik S, Rodman R, Bahram S, Grace M and High S (2007). ProofChecker, ACM SIGCSE Bulletin, 39:3, (48-52), Online publication date: 25-Jun-2007.
- Ben-Ari M Teaching concurrency and nondeterminism with spin Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education, (363-364)
- Rodger S, Lim J and Reading S Increasing interaction and support in the formal languages and automata theory course Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education, (58-62)
- Stallmann M, Balik S, Rodman R, Bahram S, Grace M and High S ProofChecker Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education, (48-52)
- Rößling G, Naps T, Hall M, Karavirta V, Kerren A, Leska C, Moreno A, Oechsle R, Rodger S, Urquiza-Fuentes J and Velázquez-Iturbide J (2006). Merging interactive visualizations with hypertextbooks and course management, ACM SIGCSE Bulletin, 38:4, (166-181), Online publication date: 1-Dec-2006.
- Rodger S (2006). Learning automata and formal languages interactively with JFLAP, ACM SIGCSE Bulletin, 38:3, (360-360), Online publication date: 26-Sep-2006.
- Rößling G, Naps T, Hall M, Karavirta V, Kerren A, Leska C, Moreno A, Oechsle R, Rodger S, Urquiza-Fuentes J and Velázquez-Iturbide J Merging interactive visualizations with hypertextbooks and course management Working group reports on ITiCSE on Innovation and technology in computer science education, (166-181)
- Rodger S Learning automata and formal languages interactively with JFLAP Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education, (360-360)
- Rodger S, Bressler B, Finley T and Reading S (2006). Turning automata theory into a hands-on course, ACM SIGCSE Bulletin, 38:1, (379-383), Online publication date: 31-Mar-2006.
- Rodger S, Bressler B, Finley T and Reading S Turning automata theory into a hands-on course Proceedings of the 37th SIGCSE technical symposium on Computer science education, (379-383)
Recommendations
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 ...
Using JFLAP to interact with theorems in automata theory
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 ...
Incorporating transformations into jflap for enhanced understanding of automata
SIGCSE 08This paper describes our experience extending the educational software program JFLAP. JFLAP enables students to design and simulate automata such as Finite State Machines, push-down automata, and Turing Machines. It is a valuable aid in any Automata ...