| Course Description |
Introduction to structure of languages and characteristic of languages: formal languages, regular languages and non-regular languages, context-free grammar and context-free languages. Describe the characteristic of state machines that are used to check the membership of languages: finite state machines, transducers, state transition machines, non-deterministic finite state machines, push-down state machines, Turing machines. Advanced theory of computation: Kleene’s theorem, recursively enumerable languages, decision problems
|
