Bulletin 2012-2013 > Courses > CS - Computer Science > Graduate Courses > CS 551

Catalog Search

Search Options

http://up.smartcatalogiq.com/Home

868c32d7-a4d9-41e0-8ba9-6df7061e04e6

https://searchproxy.smartcatalogiq.com/search

cff4d0a0-0a3b-4a65-a543-58663463e3f1

course

/Institutions/University-of-Portland/json/2012-2013/Bulletin-2012-2013-local.json

/Institutions/University-of-Portland/json/2012-2013/Bulletin-2012-2013.json

Contents

University Calendar
The University of Portland
General Information
University Academic Programs of Study
Special Academic Programs
University Centers
University Academic Regulations
Wilson W. Clark Memorial Library
College of Arts and Sciences
Dr. Robert B. Pamplin, Jr. School of Business Administration
School of Education
Donald P. Shiley School of Engineering
School of Nursing
Graduate School
University Services
Enrollment Management
Division of Student Affairs
Information Services Division
Courses
- AS - Aerospace Studies
- BIO - Biology
- BUS - Business Administration
- PCS - Program in Catholic Studies
- CHM - Chemistry
- CE - Civil Engineering
- CHN - Chinese
- CST - Communication Studies
- CS - Computer Science
  - 200
  - 300
  - 400
  - Graduate Courses
- DNC - Dance
- DRM - Drama
- ECN - Economics
- ED - Education
- EE - Electrical Engineering
- EGR - Engineering
- ENG - English
- ENV - Environmental Studies
- FA - Fine Arts
- FRN - French
- GRM - German
- HPE - Health and Physical Education
- HST - History
- MTH - Mathematics
- ME - Mechanical Engineering
- MSL - Military Science and Leadership
- MUS - Music
- NRS - Nursing
- PHL - Philosophy
- PHY - Physics
- POL - Political Science
- PSY - Psychology
- RELI - Religious Studies
- SJP - Social Justice Program
- SW - Social Work
- SOC - Sociology
- SPN - Spanish
- THE - Theology
University Governance
University Administration
Faculty
Degrees Conferred

Catalog Links

Catalog Home
Catalog Site Map
All Catalogs

Share

Print this page

CS 551 Theory of Computation

Introduction to finite automata, Turing machines, formal languages, and computability.

Credits

3