## Interactive manipulation of regular objects with FAdo (2005)

### Cached

### Download Links

- [www.ncc.up.pt]
- [www.dcc.fc.up.pt]
- [www.dcc.fc.up.pt]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of 2005 Innovation and Technology in Computer Science Education (ITiCSE 2005). ACM |

Citations: | 11 - 7 self |

### BibTeX

@INPROCEEDINGS{Moreira05interactivemanipulation,

author = {Nelma Moreira},

title = {Interactive manipulation of regular objects with FAdo},

booktitle = {In Proceedings of 2005 Innovation and Technology in Computer Science Education (ITiCSE 2005). ACM},

year = {2005},

pages = {335--339},

publisher = {ACM}

}

### OpenURL

### Abstract

FAdo 1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of interactive tools for teaching and assisting research on regular languages, and in particular finite automata and regular expressions. Those tools implement most standard automata operations, conversion between automata and regular expressions, and word recognition. We illustrate their use in training and automatic assessment. Finally we present a graphical environment for editing and interactive visualisation.

### Citations

4144 |
Introduction to Automata Theory, Languages, and Computation
- Hopcroft, Ullman
- 1979
(Show Context)
Citation Context ...alisations. Some related works are discussed in Section 5. Ongoing work is summarised in Section 6. 2. MANIPULATING REGULAR LANGUAGES We assume basic knowledge of formal languages and automata theory =-=[7]-=-. The set of regular languages over an alphabet Σ contains ∅, {ɛ} where ɛ is the empty string,s{a} for all a ∈ Σ, and is closed under union, concatenation and Kleene closure. Regular languages can be ... |

511 | Formal Languages
- Salomaa
- 1973
(Show Context)
Citation Context ...nstruct an NDFA for its type. Due to its applications in pattern recognition, this conversion is much studied in the literature and many algorithms are known. In particular, the Glushkov construction =-=[16]-=-, is currently implemented in FAdo in a separated module. 3. USING FAdo In this section we illustrate how FAdo can be used for solving (and correcting) some typical exercises for a first course in aut... |

49 | Programming Python
- Lutz
- 2006
(Show Context)
Citation Context ...to the students, giving counter-examples and pointing out the errors, thus allowing for a quicker understanding of the concepts. In this paper, we describe a collection of tools implemented in Python =-=[11]-=- that are a first step towards an interactive environment to teach and experiment with regular and other formal languages. The use of Python, a high-level objectoriented language with high-level data ... |

23 | Increasing visualization and interaction in the automata theory course
- Hung, Rodger
- 2000
(Show Context)
Citation Context ...limited. JFLAP is one of the projects that shares most of our goals. Its main motivation is teaching and the current emphasis is in animation and interactive visualisation of automata theory concepts =-=[8, 14]-=-. It supports, in particular, drawing and execution of finite-state machines, conversions between deterministic and non-deterministic, and animated conversions from and to regular expressions. Compare... |

22 | Grail: A C++ library for automata and expressions
- Raymond, Wood
- 1995
(Show Context)
Citation Context .... 5. RELATED WORK There are several projects whose goal is the manipulation of automata theory objects. Until 2000 few projects included a graphical interface. That was the case of the Grail+ project =-=[13]-=-. Grail+ operations are accessible either as individual programs (used as shell filters) or through aC++sFigure 2: FAdo graphical interface class library. In the Grail’s homepage [2], can be found a s... |

16 | AUTOMATE, a computing package for automata and finite semigroups
- Champarnaud, Hansel
- 1991
(Show Context)
Citation Context ... as shell filters) or through aC++sFigure 2: FAdo graphical interface class library. In the Grail’s homepage [2], can be found a set of links to other automata theory software which includes AUTOMATE =-=[5]-=-, AMoRE [9], Fire Lite [15], etc. In the last few years several Java applets for finite automata processing became available on-line, but normally their functionalities are very limited. JFLAP is one ... |

10 |
Visualizing principles of abstract machines by generating interactive animations
- Diehl, Kunze
(Show Context)
Citation Context ...h JFLAP one of the advantages of FAdo is its modular open source API and the possibility of constructing new methods. Gaminal is a project for the development of learning software for compiler design =-=[6]-=-. One of its components is an environment for processing finite automata. In particular, an electronic book that illustrates many of the regular languages manipulations, is available online [1]. Some ... |

10 |
A visual and interactive automata theory course with jflap 4.0
- Cavalcante, Finley, et al.
- 2004
(Show Context)
Citation Context ...limited. JFLAP is one of the projects that shares most of our goals. Its main motivation is teaching and the current emphasis is in animation and interactive visualisation of automata theory concepts =-=[8, 14]-=-. It supports, in particular, drawing and execution of finite-state machines, conversions between deterministic and non-deterministic, and animated conversions from and to regular expressions. Compare... |

9 |
A short guide to the AMoRE system
- Jansen, Potthoff, et al.
- 1990
(Show Context)
Citation Context ...ilters) or through aC++sFigure 2: FAdo graphical interface class library. In the Grail’s homepage [2], can be found a set of links to other automata theory software which includes AUTOMATE [5], AMoRE =-=[9]-=-, Fire Lite [15], etc. In the last few years several Java applets for finite automata processing became available on-line, but normally their functionalities are very limited. JFLAP is one of the proj... |

2 | Moreira N.: Using matching for automatic assessment in computer science learning environments
- Leal
- 2000
(Show Context)
Citation Context ...ntages of FAdo. Students can use the FAdo directly for training. For automatic assessment, teachers can use a Web system, based in simple CGIs or integrated in a Web learning environment, like Ganesh =-=[10]-=-. 4. INTERACTIVE VISUALISATION Currently the FAdo graphical environment allows the editing and visualisation of diagrams representing finite automata and provides an user interface to some conversion ... |

1 |
generating finite automata
- Ganifa
(Show Context)
Citation Context ...) ⋆ (012) to a NDFA. Obtain an equivalent minimal DFA and the DFA canonical form. >>> a=str2regexp("(0+1)*(012)") >>> d=NDFA2DFA(a.ndfa()) >>> d.Minimal() >>> saveToFile("e2.fa",d) >>> d.uniqueStr() [=-=[1,0,2]-=-,[1,3,2],[2,2,2],[1,0,4],[2,2,2],[4]] @DFA 3 0 1 0 0 0 1 0 2 4 1 1 2 1 0 1 1 2 4 2 1 0 2 0 1 2 2 3 3 1 4 3 0 4 3 2 4 4 1 4 4 0 4 4 2 4 Example 3. Check whether the following two regular expressions ar... |

1 |
to finite-state machines software
- Links
(Show Context)
Citation Context ...) ⋆ (012) to a NDFA. Obtain an equivalent minimal DFA and the DFA canonical form. >>> a=str2regexp("(0+1)*(012)") >>> d=NDFA2DFA(a.ndfa()) >>> d.Minimal() >>> saveToFile("e2.fa",d) >>> d.uniqueStr() [=-=[1,0,2]-=-,[1,3,2],[2,2,2],[1,0,4],[2,2,2],[4]] @DFA 3 0 1 0 0 0 1 0 2 4 1 1 2 1 0 1 1 2 4 2 1 0 2 0 1 2 2 3 3 1 4 3 0 4 3 2 4 4 1 4 4 0 4 4 2 4 Example 3. Check whether the following two regular expressions ar... |

1 | Siqueira. A framework to visualize equivalences between computational models of regular languages
- Ayala-Rincón, Fonseca, et al.
(Show Context)
Citation Context ...mata. In particular, an electronic book that illustrates many of the regular languages manipulations, is available online [1]. Some interesting considerations about algorithms animations are found in =-=[12]-=-. 6. FUTURE WORK There are several different lines of future work. Because of space limitations we just highlight some of them. Algorithm animation is easily achieved by a step by step execution. Howe... |

1 |
The FIRE Lite: FAs and REs in C
- Watson
- 1996
(Show Context)
Citation Context ...ugh aC++sFigure 2: FAdo graphical interface class library. In the Grail’s homepage [2], can be found a set of links to other automata theory software which includes AUTOMATE [5], AMoRE [9], Fire Lite =-=[15]-=-, etc. In the last few years several Java applets for finite automata processing became available on-line, but normally their functionalities are very limited. JFLAP is one of the projects that shares... |