{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:24Z","timestamp":1750308984209,"version":"3.41.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[1982,9]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/1008902.1008904","type":"journal-article","created":{"date-parts":[[2004,10,12]],"date-time":"2004-10-12T15:20:46Z","timestamp":1097594446000},"page":"58-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["On teaching theoretical foundations of Computer Science"],"prefix":"10.1145","volume":"14","author":[{"given":"Dino","family":"Mandrioli","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Udine, Udine"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1982,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/574387"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/956650.956651"},{"volume-title":"Addison-Wesley","year":"1974","author":"Aho A.","key":"e_1_2_1_3_1"},{"volume-title":"Prentice-Hall","year":"1969","author":"Ar M.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","unstructured":"\/Ar2\/ Arbib M. (ed.) Machines Languages and Semigroups Accademic Press 1968.  \/Ar2\/ Arbib M. (ed.) Machines Languages and Semigroups Accademic Press 1968."},{"volume-title":"Boringhieri","year":"1975","author":"Au G.","key":"e_1_2_1_6_1"},{"volume-title":"Geneve","year":"1980","key":"e_1_2_1_7_1"},{"volume-title":"CACM","year":"1979","author":"Cur","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","unstructured":"\/Fa\/ Fairley R. Letter on \/RS\/ - ACM Forum CACM June 1980.  \/Fa\/ Fairley R. Letter on \/RS\/ - ACM Forum CACM June 1980."},{"volume-title":"UCLA","year":"1976","author":"Gg J.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","unstructured":"\/GH\/ Goodman S. Hedetuiemi S. \"Introduction to the Design and Analysis of Algorithms Mc Graw-Hill 1977.   \/GH\/ Goodman S. Hedetuiemi S. \"Introduction to the Design and Analysis of Algorithms Mc Graw-Hill 1977."},{"volume-title":"Verification","year":"1975","author":"Gr S.","key":"e_1_2_1_12_1"},{"volume-title":"Springer Verlag","year":"1979","author":"Gor M.","key":"e_1_2_1_13_1"},{"volume-title":"Addison Wesley","year":"1968","author":"Ho J.","key":"e_1_2_1_14_1"},{"volume-title":"Addison Wesley","year":"1979","author":"Ho J.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","unstructured":"\/JT\/ Jensen R. Tonies C. (ed.) Software Engineering Prentice Hall 1979.  \/JT\/ Jensen R. Tonies C. (ed.) Software Engineering Prentice Hall 1979."},{"key":"e_1_2_1_17_1","unstructured":"\/KFA\/ Kalman F. Falb P. Arbib M. \"Topics in mathematical Systems Theory\" Mc Graw-Hill 1969.  \/KFA\/ Kalman F. Falb P. Arbib M. \"Topics in mathematical Systems Theory\" Mc Graw-Hill 1969."},{"volume-title":"Addison Wesley","year":"1973","author":"Kn D.","key":"e_1_2_1_18_1"},{"volume-title":"Mc Graw-Hill","year":"1973","author":"Ma Z.","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","unstructured":"\/MC\/ Mead Conway \"Introduction to VLSI Systems\" Addison Wesley 1980.   \/MC\/ Mead Conway \"Introduction to VLSI Systems\" Addison Wesley 1980."},{"volume-title":"Prentice Hall","year":"1967","author":"Mi M.","key":"e_1_2_1_21_1"},{"volume-title":"North Holland","year":"1978","author":"Machtey M.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/356698.356702"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/358818.358820"},{"key":"e_1_2_1_25_1","unstructured":"\/RS'\/ ACM Forum CACM June 1980: Author's Response to letters on \/RS\/  \/RS'\/ ACM Forum CACM June 1980: Author's Response to letters on \/RS\/"},{"key":"e_1_2_1_26_1","unstructured":"\/Ru\/ Russel A. Letter on \/RS\/ - ACM Forum CACM June 1980.  \/Ru\/ Russel A. Letter on \/RS\/ - ACM Forum CACM June 1980."},{"key":"e_1_2_1_27_1","unstructured":"\/Sa\/ Savage J. \"The complexity of Computing\" John Wiley & Sons 1976.   \/Sa\/ Savage J. \"The complexity of Computing\" John Wiley & Sons 1976."},{"volume-title":"4th Annual Princeton Conf. on Inf. Sci.","year":"1970","author":"Sc D.","key":"e_1_2_1_28_1"},{"key":"e_1_2_1_29_1","unstructured":"\/SM\/ Stanat P. McAllister D. \"Discrete Mathematics in Comp. Sc.\" Prentice-Hall 1977.   \/SM\/ Stanat P. McAllister D. \"Discrete Mathematics in Comp. Sc.\" Prentice-Hall 1977."},{"key":"e_1_2_1_30_1","unstructured":"\/SWP\/ Schneider G. Weingart S. Perlman D. \"An Introduction to Programming and Problem Solving with Pascal\" John Wiley and Sons 1978.   \/SWP\/ Schneider G. Weingart S. Perlman D. \"An Introduction to Programming and Problem Solving with Pascal\" John Wiley and Sons 1978."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/356596.356598"},{"key":"e_1_2_1_32_1","unstructured":"\/Wi1\/ Wirth N. \"Systematic Programming: an Introduction\" Prentice-Hall 1975.   \/Wi1\/ Wirth N. \"Systematic Programming: an Introduction\" Prentice-Hall 1975."},{"key":"e_1_2_1_33_1","unstructured":"\/Wi2\/ Wirth N. \"Algorithms + Data Structures = Programs\" Prentice Hall 1975.   \/Wi2\/ Wirth N. \"Algorithms + Data Structures = Programs\" Prentice Hall 1975."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008902.1008904","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008902.1008904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:08Z","timestamp":1750282868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008902.1008904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["10.1145\/1008902.1008904"],"URL":"https:\/\/doi.org\/10.1145\/1008902.1008904","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[1982,9]]},"assertion":[{"value":"1982-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}