The University of Tulsa
  • Skip to navigation
« Back to: College of Engineering and Natural Sciences

Department of Mathematical and Computer Sciences

computer eng banner

Home › Academics › Colleges › College of Engineering and Natural Sciences › Departments and Schools › Department of Mathematical and Computer Sciences › CS Programs of Study › Graduate and Professional Programs › Master of Science in Computer Science › CS 6483

CS 6483 - Theory of Computing

Finite automata. Regular languages and grammars. Properties of regular languages. Context free languages and grammars. Pushdown automata. Properties of context free languages. Chomsky hierarchy. Turing machines. Limits of algorithmic computation. Prerequisite: CS 3013.

  • RSS
  • Email to a Friend
  • Share
    • Facebook
    • Del.icio.us
    • Digg

Master of Science in Computer Science

  • About the Department
  • Our Faculty and Staff
  • Math Programs of Study
  • CS Programs of Study
    • Undergraduate Majors and Minors
    • Graduate and Professional Programs
      • Master of Science in Computer Science
      • Doctor of Philosophy in Computer Science
    • Certificate Programs
  • Research
  • Facilities
  • News, Events, and Publications
  • Contact
  • About TU
  • Academics
  • Research
  • Admission & Financial Aid
  • Athletics
  • Student Life
  • Calendars
  • Offices & Services
  • Libraries
  • Search
  • Technology
University Home Page

A private university dedicated to knowledge, research and community.

© 2009 The University of Tulsa | 800 South Tucker Drive, Tulsa, OK 74104 | Phone: 918-631-2000

  • About the Web Site
  • Terms & Conditions
  • Site Index
  • Contact
  • Directions
  • Support TU