Skip to content

EasyExamNotes.com

  • Home
  • Tutorial
  • Interview Q&A
  • Video Lectures
  • PYQs
  • MCQ
Menu

EasyExamNotes.com

  • Home
  • Tutorial
  • Interview Q&A
  • Video Lectures
  • PYQs
  • MCQ
Menu

Draw DFA

DFA accept even 0 and even 1 |RGPV TOC PYQ

December 3, 2023October 9, 2020 by Team EasyExamNotes

RGPV 2011Design FA which accepts even no. of 0’s and even no. of 1’s.Or RGPV 2010Construct DFA ove input alphabet Σ = {0,1} to accept string … Read more

DFA ending with 00 start with 0 no epsilon | RGPV TOC PYQ

December 3, 2023October 9, 2020 by Team EasyExamNotes

RGPV 2015Q. Design DFA accepting the following languages over the alphabet {0, 1} The set of all words ending in 00. The set of all … Read more

DFA ending with 101 | RGPV TOC PYQ

December 3, 2023October 9, 2020 by Team EasyExamNotes

RGPV 2006Q. Give DFA accepting the language over alphabet {0,1} such that all strings of 0 and 1 ending in 101. Ans. Some example strings … Read more

Construct DFA for a power n, n>=0 || RGPV TOC

December 3, 2023October 9, 2020 by Team EasyExamNotes

RGPV 2009Q. Construct DFA for anb | n>=0. Ans. Some example strings = {ab, aab, aaab, aaaab} Minimum number of states required = 2.  

Construct FA divisible by 3 | RGPV TOC PYQ

December 3, 2023October 9, 2020 by Team EasyExamNotes

RGPV 2010Construct a finite automta that will accept those strings of a binary number that are divisible ny three.or RGPV 2009construct DFA for binary integer … Read more

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