CNGB280Undergraduate
Formal Languages and Abstract Machines
Printed in the catalogue as FORMAL LANGUAGES AND ABSTRACT MACHINES
Course content
Overview of strings, languages and grammars. Concepts of abstract machine and language acceptance. Deterministic and non-deterministic finite state machines, and regular languages. Machines with pushdown tape, and context-free grammars. Turing Machines and recursively enumerable languages.
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.
- Computer Engineering (Türkiye-Azerbaijan University TAU)Year 2, Spring semester
More in CNGB
- CNGB100Computer Engineering Orientation
- CNGB111Introduction to Computer Engineering Concepts
- CNGB140C Programming
- CNGB213Data Structures
- CNGB222Statistical Methods for Computer Engineering
- CNGB223Discrete Computational Structures
- CNGB232Logic Design
- CNGB242Programming Language Concepts