Increasing engagement in automata theory with JFLAP

Rodger, Susan H.; Wiebe, Eric N.; Lee, Kyung Min; Morgan, Chris; Omar, Kareem; Su, Jonathan

doi:10.1145/1539024.1509011

Cited by 21 publications

(5 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…JFLAP [10] was designed to experiment with state machines and grammars as well as to experiment with constructive proofs. JFLAP allows the user to create and simulate several types of state machines, to create and parse strings in the language of a grammar, and to experiment with proof constructions such as converting a nondeterministic finite automaton to a deterministic finite automaton and then to a regular expression or regular grammar [10]. A study concluded that students felt more engaged and enjoyed a formal languages course more when using JFLAP [10].…”

Section: Related Workmentioning

confidence: 99%

“…JFLAP allows the user to create and simulate several types of state machines, to create and parse strings in the language of a grammar, and to experiment with proof constructions such as converting a nondeterministic finite automaton to a deterministic finite automaton and then to a regular expression or regular grammar [10]. A study concluded that students felt more engaged and enjoyed a formal languages course more when using JFLAP [10]. JFLAP provides all the primitive and transformation constructors found in FSM.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Functional Automata - Formal Languages for Computer Science Students

Morazán

Antunez

2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science. The existence of this perception is not completely absurd since students are asked to design and prove correct machines and grammars without being able to experiment nor get immediate feedback, which is essential in a learning context. This article puts forth the thesis that the theory of computation ought to be taught using tools for actually building computations. It describes the implementation and the classroom use of a library, FSM, designed to provide students with the opportunity to experiment and test their designs using state machines, grammars, and regular expressions. Students are able to perform random testing before proceeding with a formal proof of correctness. That is, students can test their designs much like they do in a programming course. In addition, the library easily allows students to implement the algorithms they develop as part of the constructive proofs they write. Providing students with this ability ought to be a new trend in the formal languages classroom.Comment: In Proceedings TFPIE 2014, arXiv:1412.473

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Functional Automata - Formal Languages for Computer Science Students

Morazán

Antunez

2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…JFLAP can also be used to create and parse strings in grammars and convert a nondeterministic finite automaton to a deterministic finite automaton. JFLAP effectiveness was assessed through a two-year study (Rodger et al, 2009) involving 12 universities the first year and 14 the second year. The goal of the experiment was to answer these questions: How effective is JFLAP in enhancing the learning process?…”

Section: Villementioning

confidence: 99%

The Role of Visualization in Computer Science Education

Fouh

Akbar

Shaffer

2012

Computers in the Schools

View full text Add to dashboard Cite

“…The first automata simulator tool was developed in the early‐1960s and increasingly sophisticated tools have been developed since . Empirical studies have revealed that automata simulator tools can help students in studying the course on theory of computation . A typical automata simulator tool helps students in the following ways: …”

Section: Introductionmentioning

confidence: 99%

Automata Simulator: A mobile app to teach theory of computation

Singh

Afreen

Chakraborty

et al. 2019

Comp Applic In Engineering

View full text Add to dashboard Cite

We developed a mobile app named Automata Simulator to simulate different types of automata and used it to teach the course on theory of computation. The students used the app to design and simulate automata during the lectures. The students also used a more sophisticated desktop application, JFLAP, to study advanced concepts related to automata theory after the lectures. An analysis of the examination results revealed that this approach helped the students to learn the concepts better and score 1% more marks. Moreover, a strong correlation between the marks obtained by the students for questions related to designing of automata and their total score was identified. In a survey conducted at the end of the semester, the students said that it was difficult to use two tools for learning the same concepts. However, they also felt that the combination of the two tools made the course more interactive and contributed positively in the process of learning. K E Y W O R D Sautomata simulator, automata theory, educational software, mobile app., Theory of computation

show abstract

Increasing engagement in automata theory with JFLAP

Cited by 21 publications

References 20 publications

Functional Automata - Formal Languages for Computer Science Students

Functional Automata - Formal Languages for Computer Science Students

The Role of Visualization in Computer Science Education

Automata Simulator: A mobile app to teach theory of computation

Contact Info

Product

Resources

About