Interactive manipulation of regular objects with FAdo (2005)

Cached

Download Links

by Nelma Moreira
Venue:In Proceedings of 2005 Innovation and Technology in Computer Science Education (ITiCSE 2005). ACM
Citations:9 - 7 self

Active Bibliography

FAdo: tools for finite automata and regular expressions manipulation – Rogerio Reis, Rogrio Reis, Nelma Moreira, Nelma Moreira - 2002
7 Subset construction complexity for homogeneous automata, position automata and ZPC-structures – J. -m. Champarnaud - 2001
1 A Reexamination of the Glushkov and Thompson Constructions – Dora Giammarresi, Jean-luc Ponty, Derick Wood - 1998
7 FAdo and GUItar: tools for automata manipulation and visualization – André Almeida, Marco Almeida, José Alves, Nelma Moreira, Rogério Reis - 2009
SEA: a Symbolic Environment for Automata theory – Philippe Andary, Pascal Caron, Gérard Duchamp, Marianne Flouret, Éric Laugerotte
4 State complexity of union and intersection of finite languages – Yo-sub Han, Kai Salomaa - 2007
1 An introduction to the FIRE engine: A C++ toolkit for FInite automata and Regular Expressions – Bruce Watson - 1994
3 The design and implementation of the FIRE engine: A C++ toolkit for FInite automata and Regular Expressions – Bruce Watson - 1994
3 Extended Context-Free Grammars and Normal Form Algorithms – Jürgen Albert, Dora Giammarresi, Derick Wood - 1998
14 Normal Form Algorithms for Extended Context-Free Grammars – Jürgen Albert, Dora Giammarresi, Derick Wood - 2000
CGM: A context-free grammar manipulator ⋆ – André Almeida, José Alves, Nelma Moreira, Rogério Reis
8 Levels of Exploration – Stephan Diehl, Andreas Kerren - 2001
4 Learning by Generation in Computer Science Education – Andreas Kerren - 2004
Animation of Relations between Computational Models and Their Language Representations – Alexsandro F. Da Fonseca, Alison H. R. Da Silva, Mauricio Ayala-Rincón, Haydée Werneck Poubel, José de Siqueira - 2001
Providing Assistance for Proofs in the Teaching of Theory of Computation – Padmanabhan Krishnan School
1 A Framework to Visualize Equivalences Between Computational Models of Regular Languages – Mauricio Ayala-Rincón, Alexsandro F. da Fonseca, Ro F. Da Fonseca, José de Siqueira, Haydée Werneck Poubel
Weakly Growing Context-Sensitive Grammars – Gerhard Buntrock, Gundula Niemann - 1996
Qualitative Dynamics – The Classi Cation
The Decidability of the Generalized Confluence Problem for Context-Free Languages – Lucian Ilie, Turku Centre, Computer Science, A Language L \sigma - 1997