2011-2012 Catalog 
    
    Nov 22, 2024  
HELP
2011-2012 Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CS 4700 - Computability, Automata and Formal Languages

3 Credits (Minimum) 3 Credits (Maximum)
Finite automata and regular expressions, context-free grammars, context-free languages, and pushdown automata, Turning machines, undecidability, the Chomsky hierarchy of formal languages, computational complexity and intractable problems. Prer., MATH 2150, MATH 3130; Engineering students only. Meets with CS 5700.


Add to Portfolio (opens a new window)
Catalog Navigation
  Catalog Home
  How To Use Your UCCS Catalog
  Academic Calendar
  From the Chancellor
  Mission, Vision, and Goals
  Admissions
  Academic Policies, Registration, and Records
  Academic Advising/Student Success/Careers
  Expenses
  Financial Aid/Student Employment
  Student Life and Services
  Student Rights and Responsibilities
  The Graduate School
  College of Business and Administration
  College of Education
  College of Engineering and Applied Science
  College of Letters, Arts, and Sciences
  Beth-El College of Nursing and Health Sciences
  School of Public Affairs
  Campus Wide Extended Studies
  Programs
  Courses
  Nursing & Health Sciences Programs Of Study
  Administration and Faculty
  My Portfolio