Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors

RGPV TOC design finite automata problems

Photo of author

By Team EasyExamNotes

RGPV 2008
Prob 01: Designa FA which accepts set of strings containing four 1’s in every string over alphabet ∑ = {0, 1}.

Ans. Some example strings = {1111,0110101, 001100110}

RGPV 2016
Prob 02. Design NFA that accepts all strings with at most 3 a’s.

Ans. Some example strings = {aaa, baba, a, ab}

RGPV 2014 
Prob 03: Construct a finite automata for the language {0n | n mod 3 = 2, n>=0}

Ans. Some example strings = {00,00000,00000000}


RGPV 2016
Design a NFA for {cbabn | n>=0}

Ans. Some example strings = {cba, cbab, cbabb, cbabbb}

Download as PDF

Related posts:

  1. RGPV TOC What do you understand by DFA how to represent it
  2. RGPV short note on automata
  3. RGPV TOC properties of transition functions
  4. RGPV TOC What is Trap state
  5. CFL are not closed under intersection
  6. DFA end with 1 contain 00 | RGPV TOC draw
  7. NFA to DFA | RGPV TOC
  8. Moore to Mealy | RGPV TOC PYQ
  9. DFA accept even 0 and even 1 |RGPV TOC PYQ
  10. Short note on automata | RGPV TOC PYQ
  11. DFA ending with 00 start with 0 no epsilon | RGPV TOC PYQ
  12. DFA ending with 101 | RGPV TOC PYQ
  13. Construct DFA for a power n, n>=0 || RGPV TOC
  14. Construct FA divisible by 3 | RGPV TOC PYQ
  15. Construct DFA equivalent to NFA | RGPV TOC PYQ
  16. RGPV Define Mealy and Moore Machine
  17. RGPV TOC Short note on equivalent of DFA and NFA
  18. RGPV notes Write short note on NDFA
  19. CNF from S–>aAD;A->aB/bAB;B->b,D->d.
  20. NDFA accepting two consecutive a’s or two consecutive b’s.
  21. Regular expresion to CFG
  22. Regular expression to Regular grammar
  23. Grammar is ambiguous. S → aSbS|bSaS|∈
  24. leftmost and rightmost derivations
  25. Construct Moore machine for Mealy machine
  26. Design a NFA that accepts the language over the alphabet, Σ= {0, 1,2} where the decimal equivalent of the language is divisible by 3.