Teaching theoretical computer science to first year undergraduates (Unknown)
- New search for: Chapman, N.
- New search for: Chapman, N.
In:
BULLETIN- EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE
;
48
;
269
;
1992
-
ISSN:
- Article (Journal) / Print
-
Title:Teaching theoretical computer science to first year undergraduates
-
Contributors:Chapman, N. ( author )
-
Published in:
-
Publisher:
- New search for: EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER
-
Publication date:1992-01-01
-
Size:269 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:Unknown
- New search for: 004
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 004 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 48
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 55
-
Predictability Dependable Computing Systems: Final ReportRandell, B. / Laprie, J.-C. et al. | 1992
- 88
-
CONcurrency and Functions: Evaluation and ReductionLevy, J.-J. et al. | 1992
- 116
-
Brazilian Crises and Research in Computer ScienceKowaltowski, T. et al. | 1992
- 121
-
A short Oxford survey of order sorted algebraGoguen, J. / Diaconescu, R. et al. | 1992
- 134
-
Characterizations of regular languages in low level complexity classesCompton, K. J. / Straubing, H. et al. | 1992
- 143
-
VALENCES: Increasing the power of grammars, transducers, grammar systemsPaun, G. et al. | 1992
- 157
-
Note on calculi for a three-valued logic for logic programmingBaaz, M. / Zach, R. et al. | 1992
- 165
-
About Gauss codesCassaigne, J. / Schwer, S. / Seebold, P. et al. | 1992
- 172
-
Bounded Petri nets of finite dimension have only finitely many reachable markingsDroste, M. / Shortt, R. M. et al. | 1992
- 175
-
An elementary proof that upper and lower powerdomain constructions commuteLibkin, L. et al. | 1992
- 178
-
Concurrent versus sequential - the rough sets perspectivePawlak, Z. et al. | 1992
- 191
-
On generalizations of the Nerode and Myhill theoremsSteinby, M. et al. | 1992
- 197
-
For a rewrite system it is decidable whether the set of irreducible, ground terms is recognizableVagvoelgyi, S. / Gilleron, R. et al. | 1992
- 210
-
Bibliography of grammar systemsKelemen, J. / Mlichova, R. et al. | 1992
- 219
-
Games on infinite trees and automata with dead-ends: a new proof for the decidability of the monadic second order theory of two successorsMuchnik, A. A. et al. | 1992
- 269
-
Teaching theoretical computer science to first year undergraduatesChapman, N. et al. | 1992