167 search results - page 24 / 34 » Mathematical Logic and Deduction in Computer Science Educati... |
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
SIGCSE
2000
ACM
14 years 28 days ago
2000
ACM
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...
APAL
2007
13 years 8 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
SIGCSE
2009
ACM
14 years 9 months ago
2009
ACM
We describe the results from a two-year study with fourteen universities on presenting formal languages in a more visual, interactive and applied manner using JFLAP. In our result...
SIGCSE
2004
ACM
14 years 2 months ago
2004
ACM
We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters...