Course details

Computational Theory: Language Principle & Finite Automata Theory

Computational Theory: Language Principle & Finite Automata Theory


Overview/Description
Expected Duration
Lesson Objectives
Course Number
Expertise Level



Overview/Description

Explore the concept of computational theory and its models. Discover how to model and implement computational theory on formal language, automata theory, and context-free grammar.



Expected Duration (hours)
0.8

Lesson Objectives

Computational Theory: Language Principle & Finite Automata Theory

  • define the theory of computation and list the prominent branches of computation
  • list the prominent models of computation
  • specify the concept of automata theory and list the prominent classes of automata
  • define the principles of finite state machine
  • recognize the essential principles driving formal language and automata theory
  • recall the essential elements of the theory of formal language
  • define regular expressions and list the theorems that are used to manage the semantics of regular expressions
  • define regular grammar and list the essential grammars that are used to generate regular languages
  • list the essential closure properties and theorems associated with regular language
  • define context-free grammar and list its prominent features
  • identify practical usage, branches, and models of computational theory, specify notations of formal language, and list types of context-free grammar
  • Course Number:
    it_mlfdctdj_01_enus

    Expertise Level
    Intermediate