Skip to content
CENG280Undergraduate

Formal Langu.and Abstract Machines

Printed in the catalogue as FORMAL LANGU.AND ABSTRACT MACHINES

Course content

Introduction to strings, languages and grammars. Concept of abstract machines and language acceptance. Deterministic and non-deterministic finite state machines. Regular expressions. Machines with pushdown tape. Turing Machines and recursive functions.

Where it sits in a curriculum

Programs whose published curriculum lists this course, and the term it falls in. Your own curriculum is the one that counts.

All CENG courses