Uma Ferramenta para Ensinar Introdução à Teoria da Computação
Abstract
Keeping students engaged from the beginning is one of the most important challenges in the undergraduate lectures. This challenge becomes more critical in theoretical subjects. This work reports the application of the concept of “proximal development zone” of the theory of Vygotsky, where a tool (“toy”) is applied to mediate student learning conflicts in the “Introduction to the Theory of Computation” subject.
References
D. Caugherty and S. H. Rodger. NPDA: A tool for visualizing and simulating nondeterministic pushdown automata. In DIMACS Workshop, pages 365–377, March 1992.
M. K. de Oliveira. Pensamento e Ação no Magistério: Vygotsky, Aprendizado e desenvolvimento, Um processo sócio-histórico, chapter 4, pages 55–79. Editora Scipione, S˜ao Paulo, 2006.
S. C. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, 1956.
W. S. McCulloch andW. H. P. Jr. A logical calculus of ideas immanent in nervous activity. Bull. Math. BioPhys., 5:115–133, 1943.
M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development archive, 3 Issue 2:114–125, 1959.
S. H. Rodger, E. Wiebe, K. M. Lee, C. Morgan, K. Omar, and J. Su. Increasing engagement in automata theory with jflap. In SIGCSE ’09 Proceedings of the 40th ACM technical symposium on Computer science education, pages 403–407. ACM New York, NY, USA, March 2009.
M. Sipser. Introdução à Teoria da Computação. Thompson Pioneira, Brasil, 2007.
A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. In Proc. London Math. Soc. Ser. 2 42, pages 230–265, 1937.
A. M. Turing. Correction to: On computable numbers, with an application to the entscheidungsproblem. In Proc. London Math. Soc. Ser. 2 43, pages 544–546, 1938.
M. K. de Oliveira. Pensamento e Ação no Magistério: Vygotsky, Aprendizado e desenvolvimento, Um processo sócio-histórico, chapter 4, pages 55–79. Editora Scipione, S˜ao Paulo, 2006.
S. C. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, 1956.
W. S. McCulloch andW. H. P. Jr. A logical calculus of ideas immanent in nervous activity. Bull. Math. BioPhys., 5:115–133, 1943.
M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development archive, 3 Issue 2:114–125, 1959.
S. H. Rodger, E. Wiebe, K. M. Lee, C. Morgan, K. Omar, and J. Su. Increasing engagement in automata theory with jflap. In SIGCSE ’09 Proceedings of the 40th ACM technical symposium on Computer science education, pages 403–407. ACM New York, NY, USA, March 2009.
M. Sipser. Introdução à Teoria da Computação. Thompson Pioneira, Brasil, 2007.
A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. In Proc. London Math. Soc. Ser. 2 42, pages 230–265, 1937.
A. M. Turing. Correction to: On computable numbers, with an application to the entscheidungsproblem. In Proc. London Math. Soc. Ser. 2 43, pages 544–546, 1938.
Published
2016-07-04
How to Cite
DE MENDONÇA, Candido Ferreira Xavier; DIGIAMPIETRI, Luciano A..
Uma Ferramenta para Ensinar Introdução à Teoria da Computação. In: WORKSHOP ON COMPUTING EDUCATION (WEI), 24. , 2016, Porto Alegre.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2016
.
p. 2422-2431.
ISSN 2595-6175.
DOI: https://doi.org/10.5753/wei.2016.9686.
