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

Regular Expression

Regular expresion to CFG

December 3, 2023November 22, 2020 by Team EasyExamNotes

To convert a regular expression to a context-free grammar (CFG), you can follow a set of standard conversion rules. Here are the rules for converting … Read more

Regular expression to Regular grammar

December 3, 2023November 22, 2020 by Team EasyExamNotes

RGPV 2020   How can we construct regular grammar from regular expression?  Ans. Lets take an regular expresion example: 0*(1(0+1))* Now convert above example in to … Read more

What is Regular Expression

December 3, 2023October 3, 2020 by Team EasyExamNotes

RGPV PYQs Q. What is a regular expression? Solution. The language accepted by finite automata can be easily described by simple expressions called regular expressions. … Read more

© 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