THEORITICAL COMPUTER SCIENCE

THEORITICAL COMPUTER SCIENCE

BASIC LANGUAGE & AUTOMATA THEORY : Review of finite automata, regular sets, Context-free grammars & languages, Moore & Mealy state machines, thier capabilities & limitations. Deterministic & Non-Deterministic FSM’s, Push-down stack & memory machine. (PDM)

TUNING MACHINES : Recursive languages, Turing acceptors, techniques for Turing machine construction, Church’s hypothesis, Turing machines as generators, variations & equivalence of Turing machines.

UNDECIDABILITY : Universal Turing machines, undecidability of the halting problem, and undecidable problems about contextfree languages.

THE CHOMSKY HIERARCHY : Grammars and their rel ations to automata, relations between classes of languages, LR(0) and LR(1) grammars , parser construction.

CLOSURE PROPERTIES OF FAMILIES OF LANGUAGES : Abstract families of languages, language operations, closure and decidability properties.

Home > Bachelor of Engineering (BE) > THEORITICAL COMPUTER SCIENCE
  1. No comments yet.
  1. No trackbacks yet.