Computational Theory: Language Principle & Finite Automata Theory

Computational Theory    |    Intermediate
  • 12 Videos | 49m
  • Includes Assessment
  • Earns a Badge
Likes 7 Likes 7
In this 12-video course, learners will explore the concept of computational theory and its models by discovering how to model and implement computational theory on formal language, automata theory, and context-free grammar. Begin by examining the computational theory fundamentals and the prominent branches of computation, and also the prominent models of computation for machine learning. Then look at the concept of automata theory and list the prominent automata classes. Next, explore the finite state machine principles, and recognize the essential principles driving formal language theory and the automata theory principles. Learners will recall the formal language elements; define the concept of regular expressions; and list the theorems used to manage the semantics. Examine the concept of regular grammar and list the essential grammars used to generate regular languages. Also, examine regular language closure properties, and defining and listing the prominent features of context-free grammar. The concluding exercise involves identifying practical usage, branches, and models of computational theory, specifying notations of formal language, and listing types of context-free grammar.

WHAT YOU WILL LEARN

  • 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

IN THIS COURSE

  • Playable
    1. 
    Course Overview
    1m 43s
    UP NEXT
  • Playable
    2. 
    Theory of Computation
    4m 55s
  • Locked
    3. 
    Computation Models
    4m 38s
  • Locked
    4. 
    Automata Theory and Classes
    2m 44s
  • Locked
    5. 
    Principles of Finite State Machine
    3m 23s
  • Locked
    6. 
    Principles of Formal Languages and Automata Theory
    5m 41s
  • Locked
    7. 
    Elements of Formal Language
    3m 51s
  • Locked
    8. 
    Regular Expressions
    5m 30s
  • Locked
    9. 
    Regular Grammar
    2m 38s
  • Locked
    10. 
    Closure Properties of Regular Languages
    3m 59s
  • Locked
    11. 
    Context-Free Grammar Features
    2m 59s
  • Locked
    12. 
    Exercise: Computation Theory and Formal Language
    1m 59s

EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion of this course, which can be shared on any social network or business platform

Digital badges are yours to keep, forever.

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Likes 78 Likes 78  
Likes 214 Likes 214  
Likes 67 Likes 67