Theory of computation from basics

Finite autometa and Regular language
Free tutorial
Rating: 4.6 out of 5 (18 ratings)
1,550 students
1hr 40min of on-demand video
English
English [Auto]

Theory of Computation - Computer Science Engineering 4th semester subject notes
Autometa
Deterministic finite Autometa, Non Deterministic Finite Autometa, Epsilon NFA with examples, Acceptebility of a string by DFA, Conversion from DFA to NFA

Requirements

  • Students should have computer science background

Description

Deterministic Finite Autometa DFA with Definition, Representation with examples, Acceptability of a string and languages, Non Deterministic Finite Autometa NFA with examples, Epsilon NFA with Example, Conversion from Epsilon NFA to NFA, Conversion from NFA to DFA, Equivalence of DFA and NFA , Minimization of Deterministic Finite Autometa, Moore Machine, Mealey Machine etc.

Who this course is for:

  • Computer Science Engineering students
  • Btech comp science,bsc comp science, MCA students
  • Beginners of TOC

Instructor

I am Computer Science Engineer with 8 years of IT exp.
Shaifali Gupta
  • 4.6 Instructor Rating
  • 18 Reviews
  • 1,550 Students
  • 1 Course

I am a Computer Science Engineer with 8 years of experience in IT and software.I have done my engineering from Govt. Eng College in 2009.I was campus recruited by WIPRO and since then I have been working  IT. I have worked in INFOSYS and IBM as well.

I am taking care of Data integration project using Oracle data integrator software.

Top companies trust Udemy

Get your team access to Udemy's top 15,000+ courses