Skip to content

EasyExamNotes.com

  • Home
  • Tutorial
  • Current Affairs
    • Current Affairs (English)
    • Current Affairs (Hindi)
  • Interview Q&A
  • Video Lectures
  • PYQs
  • MCQ
Menu

EasyExamNotes.com

  • Home
  • Tutorial
  • Current Affairs
    • Current Affairs (English)
    • Current Affairs (Hindi)
  • Interview Q&A
  • Video Lectures
  • PYQs
  • MCQ
Menu

dfa nfa example

NDFA accepting two consecutive a’s or two consecutive b’s.

December 3, 2023November 22, 2020 by Team EasyExamNotes

RGPV 2020Construct a NDFA accepting all string in {a,b} with either two consecutive a’s or two consecutive b’s. Ans.

RGPV TOC Short note on equivalent of DFA and NFA

December 3, 2023October 7, 2020 by Team EasyExamNotes

RGPV 2010, 02Q. Write short note on equivalent of DFA and NDFA ? Ans.  Every DFA is an NDFA. If from a regular set an … Read more

RGPV TOC What do you understand by DFA how to represent it

December 3, 2023October 4, 2020 by Team EasyExamNotes

RGPV 2015,14,02,03Q. What do you understand by DFA (Deterministic Finite Automata) and how is it represented ? Ans. A DFA means Deterministic finite automata or … Read more

DFA which accept 00 and 11 at the end of a string

December 3, 2023September 16, 2020 by Team EasyExamNotes

Construct a NDFA and DFA accepting string having 00 and 11 at the end of the string with input (0,1). Solution.

© 2024 EasyExamNotes.com | Some content on this site was generated with the assistance of Google's Gemini AI and ChatGPT.

  • Home
  • Tutorial
  • Current Affairs
    • Current Affairs (English)
    • Current Affairs (Hindi)
  • Interview Q&A
  • Video Lectures
  • PYQs
  • MCQ

TOC

  • Definition of Deterministic Finite Automata
  • Notations for DFA
  • How do a DFA Process Strings?
  • Properties of transition functions
  • What is Trap state ?
  • Minimization of DFA
  • DFA solved examples
  • Definition Non Deterministic Finite Automata
  • NFA with ∈-Moves
  • Remove ∈ transitions from NFA
  • NFA with ∈ to DFA Indirect Method
  • Equivalent of DFA and NFA
  • Moore machine
  • Mealy Machine
  • Moore to Mealy machine
  • Mealy to Moore Machine
  • Diiference between Mealy and Moore machine
  • What is Regular Expression
  • Regular expression
  • Regular Expression Examples
  • Regular expresion to CFG
  • Regular expression to Regular grammar
  • closure properties of regular languages
  • What is Regular Set in TOC
  • CNF: Conjuctive Normal Form
  • CNF from S–>aAD;A->aB/bAB;B->b,D->d.
  • Grammar is ambiguous. S → aSbS|bSaS|∈
  • leftmost and rightmost derivations
  • CFL are not closed under intersection
  • Arden’s Law
  • Pushdown Automata