Making turing machines accessible to blind students

SIGCSE'12 - Proceedings of the 43rd ACM Technical Symposium on Computer Science Education

Volumn , Issue , 2012, Pages 167-172

  Crescenzi, Pierluigi ^a   Rossi, Leonardo ^a   Apollaro, Gianluca ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

computability; software accessibility; turing machines

Indexed keywords

COMPUTABILITY; FULLY COMPATIBLE; THEORETICAL COMPUTER SCIENCE; VALIDATION RESULTS;

MACHINERY; TEACHING; TURING MACHINES;

STUDENTS;

EID: 84858959617     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2157136.2157190     Document Type: Conference Paper

References (17)

1. F. Battaglia. MLFreeTTS. Available at visilab.unime.it.
2. E. Bergman and E. Johnson. Towards accessible human-computer interaction. Advances in human-computer interaction, 5, 87-113, 1995.
3. A.W. Black and K.A. Lenzo. Flite: a small fast run-time synthesis engine. Proc. ISCA Workshop on Speech Synthesis, 2001.
4. R.F. Cohen, A. Meacham, and J. Skaff. Teaching graphs to visually impaired students using an active auditory interface. Bull. SIGCSE, 38, 279-282, 2006.
5. M.E. Califf, M. Goodwin, and J. Brownell. Helping him see: guiding a visually impaired student through the computer science curriculum. Proc. SIGCSE, 444-448, 2008.
6. C. Jayant, M. Renzelmann, D. Wen, S. Krisnandi, R.E. Ladner, and D. Comden, Automated Tactile Graphics Translation: In the Field Proc. SIGACCESS, 75-82, 2007.
7. JFLAP. Available at www.cs.duke.edu/csed/jflap
8. Oracle SDN. Java SE Desktop Accessibility. Available at java.sun.com/javase/technologies
9. Freedom Scientific. Jaws for Windows. Quick start guide. Available at www.freedomscientific.com.
10. S.H. Rodger and T.W. Finley. JFLAP: An Interactive Formal Languages and Automata Package Jones & Bartlett Publishers, 2006.
11. M. Sipser. Introduction to the Theory of Computation (2nd ed.). Massachusetts Institute of Technology, 2006.
12. M. Stallmann, S. Balik, R. Rodman, S. Bahram, M. Grace, and S. High ProofChecker: An Accessible Environment for Automata Theory Correctness Proofs. Proc. ITICSE, 48-52, 2007.
13. A.M. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42, 230-265, 1936.
14. Università deli Studi di Pisa. Gara nazionale di programmazione della machine di Turing. Available at mdt.unipi.it.
15. W. Walker, P. Lamere, and P. Kwok. FreeTTS: a performance case study. SMLI TR-2002-114. Sun Microsystems, 2002.
16. W. Walker, P. Lamere, and P. Kwok. FreeTTS. Available at freetts.sourceforge.net
17. F. Winberg and J. Bowers. Assembling the Senses: Towards the Design of Cooperative Interfaces for Visually Impaired Users. Proc. CSCW, 332-341, 2004.