Catalog Navigator

UMKC Catalog

Home
Table of Contents
Introduction
Special Notices
Academic Programs
Undergraduate Admission Policy & Procedures
Undergraduate Academic Regulations and Information
Graduate Academic Regulations and Information
Division of Student Affairs
Libraries
University College
Arts and Sciences, College of
Biological Sciences, School of
Computing and Engineering, School of
Dentistry, School of
Education, School of
Graduate Studies, School of
Law, School of
Management, Henry W. Bloch School of
Medicine, School of
Music and Dance, Conservatory of
Nursing, School of
Pharmacy, School of
Pre-Medicine/Pre-Health
Faculty
Undergraduate Courses
Graduate Courses
Appendices

Table of Contents - Introduction To Computability, Formal Languages And Automata

COMP-SCI 493 Introduction To Computability, Formal Languages And Automata

Regular expressions and finite state machines. Context-free grammars and pushdown automata. Turing machine. Church's Thesis. Primitive recursive functions and computational complexity. Undecidability.

Prerequisite(s): COMP-SCI 291

Faculty: School of Computing & Engineer

Department: Comp Sci & Elect Engr

Back

HOME | TEXT ONLY | DISABILITY SERVICES | CONTACT US

© Curators of the University of Missouri. DMCA and other copyright information. University of Missouri-Kansas City | Kansas City, MO 64110 | (816) 235-1000
UMKC is an equal opportunity/affirmative action institution. Email questions or comments about this website to webmaster@umkc.edu.