Concretization and animation of Finite Automata with c-cards

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskning

Resumé

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.
OriginalsprogEngelsk
TitelProceedings of the Third Program Visualization Workshop
ForlagDepartment of Computer Science, University of Warwick
Publikationsdato2004
ISBN (Trykt)0902683748
StatusUdgivet - 2004
Udgivet eksterntJa

Fingeraftryk

Finite automata
Animation
Computer science
Students

Citer dette

Valente, A. (2004). Concretization and animation of Finite Automata with c-cards. I Proceedings of the Third Program Visualization Workshop Department of Computer Science, University of Warwick.
Valente, Andrea. / Concretization and animation of Finite Automata with c-cards. Proceedings of the Third Program Visualization Workshop. Department of Computer Science, University of Warwick, 2004.
@inproceedings{08fca474168c4456a91d71ae06d0b15d,
title = "Concretization and animation of Finite Automata with c-cards",
abstract = "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.",
author = "Andrea Valente",
year = "2004",
language = "English",
isbn = "0902683748",
booktitle = "Proceedings of the Third Program Visualization Workshop",
publisher = "Department of Computer Science, University of Warwick",

}

Valente, A 2004, Concretization and animation of Finite Automata with c-cards. i Proceedings of the Third Program Visualization Workshop. Department of Computer Science, University of Warwick.

Concretization and animation of Finite Automata with c-cards. / Valente, Andrea.

Proceedings of the Third Program Visualization Workshop. Department of Computer Science, University of Warwick, 2004.

Publikation: Bidrag til bog/antologi/rapport/konference-proceedingKonferencebidrag i proceedingsForskning

TY - GEN

T1 - Concretization and animation of Finite Automata with c-cards

AU - Valente, Andrea

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

M3 - Article in proceedings

SN - 0902683748

BT - Proceedings of the Third Program Visualization Workshop

PB - Department of Computer Science, University of Warwick

ER -

Valente A. Concretization and animation of Finite Automata with c-cards. I Proceedings of the Third Program Visualization Workshop. Department of Computer Science, University of Warwick. 2004