uLektz logo
login images close

Verify Account

A Verification Code has been sent to you registered email address shown below. Please enter the code to verify your account. You may edit the email address, if it is incorrect

Resend Code

Note: Please check your Spam or Junk folder, in case you didn't receive the email with verification code.

Learning Path

Non-Linear: Random Order

About the Course

Course Description

This course provides students with concepts of Fundamentals of Automata- Computation, Finite State Machine, Automata Classification, Automata in Real World, Formal Language Theory- Symbols, Alphabets and Strings, Operations on Strings, Formal Languages, Operations on Languages and Formal Languages/ Grammar Hierarchy: Formal Languages, Regular Language, Context-Free Language, Context-Sensitive Language, Recursive Language, Recursively Enumerable Language, Other Forms of Form

Objectives 

1.Will familiarize about Equivalent Finite-State Automata, Equivalence of NFA/NFA- ɛ and DFA, Equivalence of NFA, with Є moves to NFA, without Є - moves.

2.Will demonstrate Two way DFA, DFA Vs 2DFA

3.Will develop knowledge in implification of Context – Free Grammar: Simplification of Context-Free Grammars, Elimination of Є -Productions

Prerequisite

There is no particular prerequisite to learn Formal Languages, you will be able to do very well, if you have these basic skills: 

1. Basic Analytics Skills

2. Good Understanding Skills

3. Good Communication Skills

.

Course Study Materials
Module 1: Fundamentals of Automata
  • 1.1 Fundamentals of Automata- Computation, Finite State Machine
  • 1.2 Components of Finite State Automata
  • 1.3 Automata Classification, Automata in Real World
  • Fundamentals of Automata 10 Questions
Module 2: Formal Language Theory and Formal Languages / Grammer Hierarchy
  • 2.1 Formal Language Theory- Symbols, Alphabets and Strings, Operations on Strings, Formal Languages, Operations on Languages
  • 2.2 Formal Languages/ Grammar Hierarchy: Formal Languages, Regular Language, Context-Free Language, Context-Sensitive Language, Recursive Language, Recursively Enumerable Language, Other Forms of Form
  • 2.3 Relationship between Grammars and Languages
  • Formal Language Theory and Formal Languages / Grammer Hierarchy 10 Questions
Module 3: Finite Automata and Equvalent Automata
  • 3.1 Finite Automata: Introduction, Deterministic Finite Automata(DFA), Design of DFAs, Non Deterministic Finite Automata(NFA), Non-Deterministic Automata with Є-moves ,Design of NFA- Є s, Advantages o
  • 3.2 Equivalent Automata: Equivalent Finite-State Automata, Equivalence of NFA/NFA- ɛ and DFA, Equivalence of NFA, with Є moves to NFA, without Є - moves.
  • Finite Automata and Equvalent Automata 10 Questions
Module 4: Minimization/ Optimization of DFA, Regular Expressions and Languages and Finite Automata and Regular Expressions
  • 4.1 Minimization/ Optimization of DFA: Optimum DFA, Minimal DFA
  • 4.2 Two way DFA, DFA Vs 2DFA
  • 4.3 Finite Automata and Regular Expressions:Properties of Regular Sets and Regular Languages, Arden’s Theorem
  • Minimization/ Optimization of DFA, Regular Expressions and Languages and Finite Automata and Regular Expressions 10 Questions
Module 5: Transducers, Context Free Grammers and Context-Free Languages and Simplification of Context Free - Grammer
  • 5.1 Transducers: Moore Machine, Mealy Machine, Difference between Moore and Mealy Machines, Properties / Equivalence of Moore and Mealy Machines
  • 5.2 Simplification of Context – Free Grammar: Simplification of Context-Free Grammars, Elimination of Є -Productions
  • 5.3 Elimination of Unit Productions, Normal Forms for Context Free Grammars, Chomsky Normal Form, Greibach Normal Form, Chomsky Vs Greibach Normal Form, Application of Context- Free Grammars
  • Transducers, Context Free Grammers and Context-Free Languages and Simplification of Context Free - Grammer 10 Questions
Module 6: Turing Machine and TM Extensions and Languages
  • 6.1 Turing Machine: Introduction, Components of Turing Machine, Description of Turing Machine
  • Turing Machine and TM Extensions and Languages 10 Questions
Final Assessment
  • Final Assessment 20 Questions

The certificate issued for the Course will have

  • Student's Name
  • Photograph
  • Course Title
  • Certificate Number
  • Date of Course Completion
  • Name(s) and Logo(s) of the Certifying Bodies
  • .

    Only the e-certificate will be made available. No Hard copies. The certificates issued by Global uLektz Academy. can be e-verifiable at www.ulektzskills.com/verify.

    • Students will be assessed both at the end of each module and at the end of the Course.
    • Students scoring a minimum of 50% in the assessments are considered for Certifications
    certificate
...
₹2499
Features:
  • 60 hours Learning Content
  • 100% online Courses
  • English Language
  • Certifications

Course

Registration opens on 04-02-2019

Course

Your registration details are under review. It should take about 1 to 2 working days. Once approved you will be notified by email and then you should be able to access the course.

Course Approved

Approval Pending - In-Progress

Course access details will be shared within 24 hours.
For help contact: support@ulektz.com

Course Enrollment

Course

Course starts on 07-10-2022

Course

You have completed 6 hours of learning for 30-01-2023. You can continue learning starting 31-01-2023.

Course

This course can only be taken in sequential order.

Course

You have completed the course. You will be notified by email once the certificate is generated.

Course

Are you sure want to enroll this course?.

Course

Course

S.no Date Title Reason

Result Summary

Introduction to Formal Languages