Udemy
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Theory of computation from basics
Rating: 4.4 out of 5(179 ratings)
2,279 students

Theory of computation from basics

Finite autometa and Regular language
Created byShaifali Gupta
Last updated 5/2020
English
English [Auto],

What you'll learn

  • 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

Course content

1 section • 7 lectures • 1h 39m total length

  • Introduction10:10

    What is Autometa.

    Finite Automet Definition

    Types of Autometa.

  • Formal definition of DFA , DFA with examples.22:11

    DFA technical definition with example.

    DFA examples with solution for practice and exam purpose.

  • Acceptability of a String by given Autometa15:11

    Analyze how a deterministic finite automaton accepts a string by tracing the transition function from the initial state to a final state, with final states forming the acceptance condition.

  • Non deterministic Autometa formal definition with example9:40

    Explore non deterministic finite automata, where an input from a state may lead to multiple next states, with a transition function mapping to subsets of states and final states.

  • Epsilon NFA with Example11:42

    epsilon NFA definition and examples

  • DFA examples with trap state, NFA to DFA Conversion part 116:49

    Explore dfa design for languages with exactly one a and with at most one a, including trap states, and learn nfa to dfa conversion with epsilon transitions.

  • DFA examples with trap state, NFA to DFA Conversion part 214:15

    This lecture explains converting a non-deterministic finite automaton to a deterministic one using the subset construction, including handling multiple states, initial and final state mapping, and the trap state.

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

Report abuse