A Card Game Proposal for Approaching Regular Languages: DOI 10.54798/CJOK6586

• Narvaez-Teran, Valentina ^[1] ; Martinez Elizalde, Lorena ^[1]
  1. [1] Instituto Tecnológico y de Estudios Superiores de Monterrey

     Instituto Tecnológico y de Estudios Superiores de Monterrey

     México

     
• Localización: Emprendimiento Científico Tecnológico, ISSN-e 2810-8493, Nº. Extra 5, 2024
• Idioma: español
• Enlaces
  • Texto completo (pdf)
• Resumen

  • Formal languages are a relevant subject in computer science programs, they are a fundamental cornerstone for the development of programming languages, pattern recognition in texts, and they are deeply related to the theory of computation, including problems and their complexity. This work proposes a turn-based competitive card game that models the basics of regular languages, also known as type-3 languages. Through this game’s mechanics, we aim to model relevant formal concepts, such as languages, symbols, alphabets, words, operators and word matching with regular expressions. We present the rules of the game and the design reasoning behind them, explaining how this rules relate to the abilities students require to work with regular languages. We report some early feed back received from computer science students.