The Vienna Definition Language
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Curriculum '78—is computer science really that unmathematical?
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
The Complexity of Computing
Theory of Program Structures: Schemes, Semantics, Verification
Theory of Program Structures: Schemes, Semantics, Verification
The Denotational Description of Programming Languages: An Introduction
The Denotational Description of Programming Languages: An Introduction
Algorithms + Data Structures = Programs
Algorithms + Data Structures = Programs
Systematic Programming: An Introduction
Systematic Programming: An Introduction
Design of Well-Structured and Correct Programs
Design of Well-Structured and Correct Programs
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An Introduction to Programming and Problem Solving with Pascal
An Introduction to Programming and Problem Solving with Pascal
Introduction to VLSI Systems
An Introduction to the General Theory of Algorithms
An Introduction to the General Theory of Algorithms
Introduction to the Design and Analysis of Algorithms
Introduction to the Design and Analysis of Algorithms
Discrete Mathematics in Computer Science
Discrete Mathematics in Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Mathematical Theory of Computation
Mathematical Theory of Computation
Preliminary Ada reference manual
ACM SIGPLAN Notices - Preliminary Ada reference manual
Computation: finite and infinite machines
Computation: finite and infinite machines
Formal languages and their relation to automata
Formal languages and their relation to automata
Theories of abstract automata (Prentice-Hall series in automatic computation)
Theories of abstract automata (Prentice-Hall series in automatic computation)
Journal of Computing Sciences in Colleges
From theory to practice: NP-completeness for every CS student
Proceedings of the 18th ACM conference on Innovation and technology in computer science education
| Hi-index | 0.00 |
Theoretical foundations of Computer Science (Automata Theory, Complexity, Formal Languages . . .) are taught almost everywhere within Computer Science curricula. However little effort is usually done to present this material in an integrated and motivated way, that is in such a way that its application and use in the solution of practical problems appears to any student.A proposal is developed in order to overcome this inadequacy and to emphasize the basic aspects of theoretical Computer Science.