Concretization and animation of Finite Automata with c-cards

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskning


to classes of 10 to 12 years old, and in general to students with a limited mathematical background. Our approach builds on {\em computational cards} (or c-cards), a project aiming at scaling-down the learning complexity of computer science core contents, by presenting symbol manipulation via a tangible, physical metaphor. C-cards are still at a very early stage of development as an educational tool, yet we believe they represent a nice, intuitive mind-tool, that can be consistently applied to a variety of (theoretical) computer science concepts. Here an algorithm for mapping finite automata on c-cards is given and its educational implication discussed: the mapping provides a mean to concretize and animate automata. The algorithm works with both deterministic and non-deterministic finite automata.
TitelProceedings of the Third Program Visualization Workshop
ForlagDepartment of Computer Science, University of Warwick
ISBN (Trykt)0902683748
StatusUdgivet - 2004
Udgivet eksterntJa


Dyk ned i forskningsemnerne om 'Concretization and animation of Finite Automata with c-cards'. Sammen danner de et unikt fingeraftryk.