On the achievements of high school students studying computational models

Michal Armoni, Judith Gal-Ezer

Research output: Contribution to journalConference articlepeer-review


One of the units in the relatively new high school CS curriculum which is being implemented in Israel is a theoretical unit on computational models. It includes deterministic and non-deterministic finite automata, regular and non-regular languages, closure properties of regular languages, pushdown automata, closure properties of context free languages, Turing machines, the Church-Turing thesis and the halting problem. This paper focuses on part of a study we conducted dealing with the achievements of high school students studying this unit. Specifically, this paper compares the achievements of students on the technical parts of this unit vs. its theoretical parts. We also examine the correlation between achievements of students studying the Computational Models unit, and two other factors: The students' previous computer-related background (not necessarily computer science) and the level on which they studied mathematics.

Original languageEnglish
Pages (from-to)17-21
Number of pages5
JournalSIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)
Issue number3
StatePublished - Sep 2004
EventITiCSE 2004 - 9th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education - Leeds, United Kingdom
Duration: 28 Jul 200430 Jul 2004


  • Computational model
  • Computer-related background
  • Finite automata
  • Mathematics level
  • Pushdown automata
  • Turing machines


Dive into the research topics of 'On the achievements of high school students studying computational models'. Together they form a unique fingerprint.

Cite this