[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"6cd297b58a1a6e82701c28e5c69658fa4ec427d7830eb8f651f275b249f45bb0","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"6cd297b58a1a6e82701c28e5c69658fa4ec427d7830eb8f651f275b249f45bb0","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"0dab4239b537e206a9b989a3a1cc9fab73ac652d84d6707e0cac7a46d102f738","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"0dab4239b537e206a9b989a3a1cc9fab73ac652d84d6707e0cac7a46d102f738","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"f33701be20771e20027335540bacd1bf2d2195a6aaedfbff3dc67b7c4fe7f5e7","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"70ab00c8a846e8c76180007008b0e2f59d6a64dd85bb558d6b10a5e9559d3478","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"e7c2fee9c891f24664c77c1c0cb740bfa8e852ad6f9d98a924384bc90c8d12b6","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"60405c2ab03df3242b8348d57197e7f01270553db1b2dea01dfa00e805229fa7","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"610317092a6384ef2ad42259ef3cd65a7925ca26f602ea46eecbdd8fa5d45f9e","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"c56cd8a70d241113e6991abf7db25b6ca78afcbf5a50a2fa483be2d78993f514","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"46ff773a6469beebb6ca4e249140119ec477999b339d9808a2ce0cfa41872a30","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"bb40c78d8a1e227336a5a760e909ff92315f98180231f4142cd02eabad66d4a0","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"b3cb44b0c0b410c48f2fc73e43b8cc6d56c32fe4f0d80c2adc49032dd28be1e6","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"7b20a037436e4fed98129de6e33dd4e111f9cdc3d37895b0b471ac593ac22931","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"93851ed0d6dc914adee029be6ba91f20b9801bd2029162857bde78b8692fb547","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"e91d4fb83f11e48cfd6d02a889bb11cb778a96cd816af6c714d16f63dc591d2c","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"a3109d4afa9cae88c732b4f3dd445a418d54266655616bdb846f2530eb75db4c","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"bc108bfa69c51d31c36a2d2b2aa8f19718b0fffcb602ec56f8db25d36f035aab","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"d913387e5918870568ce581a4fbd6dc21c56be86ce7394f1633eb184245768fe","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"b53803585a0678e2ee72721b3d3f649a60e3ae21e6bc1aa8f68385de36e6de73","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"81f9b7609f029a028e899e58d92d965ffaeee65b670686add2185bf6eee4d7a2","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"4a2a4b8f7a0be26f67b27261d8895b074a13f7c92c44801e4347e86e01800e68","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"80ceb1bf0ea574072698c9b777f038522ed6cfead5161854b0ba3c8782dc0213","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"931fbb4e4a366fc21c0b69a502ddba27cd69c66475280d7c8e7df11653b84f1d","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"cf201827f4108a1e646d7992bceb7d09a168d9684cb2bcfe272b633a0d2e72a2","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"204db43ec2a158a9f5506b47651417494e44e9da12a659d1fe5c9c0df049e578","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"bd964906cff5678df60e6ed3ff6996c47f722045ff146e4ca1e08cef736dfc1b","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"2e557b518fec034dfebb9349b891293a04e14db25fdd9bfee536ef3acb43c012","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"c95e14becd75b1a4226c7717e86820f98f83bc01b2d9d11d53cec472b3fba4d7","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"faf5123707e8107cae4d42b6038ec0128695900503205acec061663aa37cddc1","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"7e76cd06b502757956a0b03680276829c9974a4445f2491a89b732cb35042aa9","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"c2efe330a9171f4d6e7258e33b1185779afca07090c9ae1558960ff93a8fd392","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"6d9737f3e33b428d60c28f8a0ccfc64e55621b34705953b57e6383ff232e415d","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"b16c4742bb7617b122057c2c0c5360a156ff5193303d19f9c64d2c0c1685d86f","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"312506ab18933deb052f8b694e113f8313f5a5c4f69173e11b49b283e7e46466","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"8de54eca9d74af90723dca059a44d98c8870f2bd134bdf59d2755d3fc3bf4bb9","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"1963c9515be9521e8061ed54ebd7f63e8788995459cbebaf9d998b9faa00522a","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"5dea3233e942d5f5e4e417aaee521c5d543585bade7e576e26a807cf144dbede","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"9fd34973161dca7bea8580563d0d6af39b350cb62f4e601895c50a1262e3fe52","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"ee1bc2363246006ce49d3d6271aa27e32a6d168992c29fcca731e2a282eaf17d","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"38bdc73e53b0583d218bc6b2aa46fd737180148ebc17ed675dfb1df65959ec53","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"7705d2b976eea79be2baa300828ecd766bfd3397ae05ff6a8014146e817f739e","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"254ce563afea9eeef19ec3de3bc77499b54d76e187f7574475800e00828cf6cb","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"10c8601987efc271b1eabacc08d4d16c7d3f0d85445b3fbf440088dea2821086","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"a929644ad9f614d853a460e2c3fcee6465fe3de44a48ae38cf27b9f5032d6abc","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"2b17eddfcce6e4a67355985f50ac4e7ea69c416d9bfb1587cc92e9d9fc0d0b2a","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"cb74d82c5850866b632aacef01048f35b80595a4e4076c0710390f18a72c5fe3","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"28191c29e3f671167f0248a85b43535c75ccb6eb16fce592b53231d606bf1442","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"125019f81eefe5a3949858512dfe3b62ec99579cea678a52f3b48e80f6bab073","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"e8700b3ae37426b31d4830b0efbc4eae7f89bec6d4b81a70374603380c4f61ea","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"07ab43d86d540b276d5ae6e2ba12ab0d70ab0fdf87d9a7bb71fcc560f246eb5b","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"5a538afb07355f10d227751864cd1a3753cc0314b69c85ca82e5379681f78aed","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"d5d208bb5e6137bb1c2b102e4852561b00e8a8828be398908dd4f3aa4652e5f9","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"74d822d4999c5a3bcae820c9c386a60ac4fd253238c6a5ca116bb912ab3f427c","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"ff2a27a396c5bb577dd9715df65cb4c492fe3e92fc3ac19ab5add9e13481cf0d","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"b51473f896c9a329baa9966a808a7eb7316d1f6884539f1fdf32956632f15ea0","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"79831527eb3a1a432cccd94147ca8f2230f36021125b16fa799ac3b7876b427b","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"c9a3bd3531286ee0d64efa46fc4bfd95383d494cc23456dcacd8a1c04f928869","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"e376152b1338191322b6de1d6630b7957abcf783a06c68ef82f088f701de855d","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"a3c75486a3e05fd5810a67615ba9074dd307c915f634f2731ac81a3c71888c82","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"d3128d0b5d957e9bf36c6187dab92593e388332992074e337f346a431f7b337d","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"6365ccc3c8afdf1230d9005273c0d1a3261a5002aaf917a641074086e6ca0642","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"196e5d94cba124430f53bc8005b756a3eea5a13e89bee4f2e744fcd176f212be","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"3c3d89d82b7a3173437f4a9234e9139f1c7c3a6f20ed4e16d98915dd401150c3","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"a228d36330946b3da64c13ede616c71eeb8b09df99be5c05f18b890fb43abc1b","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"a697ae72d3899af5fcf57ffcd4bcf474816413d20ad4163f2830e8aebf574cdd","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"cb74d82c5850866b632aacef01048f35b80595a4e4076c0710390f18a72c5fe3","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"19dca1ae21d695b10df49f745aae0e87902e6637765759c78e01aa87d3bdb1f1","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"b080e08922f82e00126f1337de6b9dbde8c7af89cb16e5036447bbed35f1ed34","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"58376cb6e3185b31fe8395e380e331ef244f016bffbd5dcd4027e47a4289625b","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"afbdf3cb15e6bee42d81adf5bf6e33b7e7d8af35f49d348856715cfcd66f43cb","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"a4a8d93720c7a893d34a23523dfda3419622a4a33c1d5a607671cee2ec2ef513","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"71de2d34a4940d03890094454f7d7f2d67afd618649f7eb56c88ac404fe801fb","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"50fe54ccaff6b5219960cf45b8a9c8c2e9372834f210ebfe5559de7183a9dac6","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"9a06311a259132e7d1d017e763de7b1c8bf35ff6e0709341c7e3ef47bb273dec","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"9780f603b20b8c6665a876eec8b9a2b7aa8e3ab7b68c7d6ff54868b320732c43","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"0b146a9db9f32a6103acd56e498bf1f1d5260f750609db5b47643d6dfd0e2e11","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"3d832e2da44caa3d347d416b989bd6b6df4caea00cd26e0b5039b7c8743da19c","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"f7426c5070fc36a5724c31300da57f7335d516b6aa1b0274a74d171f1183df8b","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"2126aaa2cb10cb7ca1bf1cbb87c7b771acb710277099771b21a8c7cf67a75d3d","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"b241bbf6975a42ff1b7496f32e0e49ec9df7078cb19efb675b439ce9197390e7","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"989927f926154593a3cbee0fa1b444eed281412afaaff6d8a513a9807de7bd93","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"408fed2ffbf617224449b27f16c8f2eb7d6eb72a448792c70e4fac44df1177fa","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"145f303f700777793a993c90c4e9b6ae7d9e45e7aa8fe04edb2bea45a652c24c","course_id":"COMPSCI 520","course_uid":"course_1789820d64d4298321fc24d2","catalog_version_id":"ef0f2883209add998ff8a3b2a2688845173887766cf9e56de485ed9027a3ce44","course_number":520,"subjects":["COMPSCI"],"title":"INTRODUCTION TO THEORY OF COMPUTING","description":"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory. Additional topics include context-free grammars and languages, and complexity-theoretic cryptography.","requirements_text":"(MATH/​COMP SCI  240orSTAT/​COMP SCI/​MATH  475) and (COMP SCI 367 or400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals"}]