Search Results

MATH 4660  AUTOMATA, COMPUTABILITY, AND FORMAL LANGUAGES (3 credits)

This course presents a sampling of several important areas of theoretical computer science. Definition of formal models of computation and important properties of such models, including finite automata and Turing machines. Definition and important properties of formal grammars and their languages. Introduction to the formal theories of computability and complexity. (Cross-listed with CSCI 4660, CSCI 8666, MATH 8666)

Prerequisite(s)/Corequisite(s): MATH 2030. Recommended: CSCI 3320/CSCI 8325.

Computer Engineering, Bachelor of Science

http://catalog.unomaha.edu/undergraduate/college-engineering/electrical-computer-engineering/computer-engineering-bs/

...Database Management Systems Math (MATH) Courses: 4150/8156...4620/8626 Computer Graphics 4660/8666 Automata, Computability...

Electrical Engineering, Bachelor of Science

http://catalog.unomaha.edu/undergraduate/college-engineering/electrical-computer-engineering/electrical-engineering-bs/

...Management UNL MATH 495 Seminar UNL MATH 496...Digital Communication Systems ECEN 4660 core Telecommunications Engineering...