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

DFA ending with 101 | RGPV TOC PYQ

Photo of author

By Team EasyExamNotes

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

Ans. Some example strings = {101, 10101, 01101, 00101, 111o1, 1101}
Regular expression = (0+1)*101
Minimum number of states required = 4

Download as PDF

Related posts:

  1. DFA accept even 0 and even 1 |RGPV TOC PYQ
  2. DFA ending with 00 start with 0 no epsilon | RGPV TOC PYQ
  3. Construct DFA for a power n, n>=0 || RGPV TOC
  4. Construct FA divisible by 3 | RGPV TOC PYQ
  5. NFA to DFA | RGPV TOC
  6. Moore to Mealy | RGPV TOC PYQ
  7. RGPV TOC What do you understand by DFA how to represent it
  8. RGPV short note on automata
  9. RGPV TOC properties of transition functions
  10. RGPV TOC What is Trap state
  11. CFL are not closed under intersection
  12. Short note on automata | RGPV TOC PYQ
  13. Construct DFA equivalent to NFA | RGPV TOC PYQ
  14. RGPV Define Mealy and Moore Machine
  15. RGPV TOC Short note on equivalent of DFA and NFA
  16. RGPV notes Write short note on NDFA
  17. CNF from S–>aAD;A->aB/bAB;B->b,D->d.
  18. NDFA accepting two consecutive a’s or two consecutive b’s.
  19. Regular expresion to CFG
  20. Regular expression to Regular grammar
  21. Grammar is ambiguous. S → aSbS|bSaS|∈
  22. leftmost and rightmost derivations
  23. Construct Moore machine for Mealy machine
  24. Design a NFA that accepts the language over the alphabet, Σ= {0, 1,2} where the decimal equivalent of the language is divisible by 3.
  25. Definition of Deterministic Finite Automata
  26. Notations for DFA
  27. How do a DFA Process Strings?
  28. DFA solved examples
  29. Definition Non Deterministic Finite Automata
  30. Moore machine
  31. Mealy Machine
  32. Regular Expression Examples
  33. Regular expression
  34. Arden’s Law
  35. NFA with ∈-Moves
  36. NFA with ∈ to DFA Indirect Method
  37. Define Mealy and Moore Machine
  38. What is Trap state ?
  39. Equivalent of DFA and NFA
  40. Properties of transition functions
  41. Mealy to Moore Machine
  42. Moore to Mealy machine
  43. Diiference between Mealy and Moore machine
  44. Pushdown Automata
  45. Remove ∈ transitions from NFA
  46. TOC 1
  47. Diiference between Mealy and Moore machine
  48. What is Regular Expression
  49. What is Regular Set in TOC
  50. DFA which accept 00 and 11 at the end of a string
  51. DFA end with 1 contain 00 | RGPV TOC draw
  52. RGPV TOC design finite automata problems
  53. Minimization of DFA
  54. Construct NFA without ∈
  55. RGPV TOC PYQs
  56. Introduction to Automata Theory