Design a NFA that accepts the language over the alphabet, Σ= {0, 1,2} where the decimal equivalent of the language is divisible by 3.

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. NFA to DFA | RGPV TOC
7. Moore to Mealy | RGPV TOC PYQ
8. DFA accept even 0 and even 1 |RGPV TOC PYQ
9. Short note on automata | RGPV TOC PYQ
10. DFA ending with 00 start with 0 no epsilon | RGPV TOC PYQ
11. DFA ending with 101 | RGPV TOC PYQ
12. Construct DFA for a power n, n>=0 || RGPV TOC
13. Construct FA divisible by 3 | RGPV TOC PYQ
14. Construct DFA equivalent to NFA | RGPV TOC PYQ
15. RGPV Define Mealy and Moore Machine
16. RGPV TOC Short note on equivalent of DFA and NFA
17. RGPV notes Write short note on NDFA
18. CNF from S–>aAD;A->aB/bAB;B->b,D->d.
19. NDFA accepting two consecutive a’s or two consecutive b’s.
20. Regular expresion to CFG
21. Regular expression to Regular grammar
22. Grammar is ambiguous. S → aSbS|bSaS|∈
23. leftmost and rightmost derivations
24. Construct Moore machine for Mealy machine
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. TOC#01 | What is DFA in Hindi video | Automata
57. TOC#02 | What is NFA in Hindi video | Automata 
58. TOC#03 | Trap State in Hindi video | Automata
59. TOC#04 | Draw a DFA accepting strings starting with ab | Theory of computation in Hindi video
60. TOC#05 | Draw a DFA starting with ‘a’ | Theory of computation in Hindi video
61. TOC#06 | Draw a DFA starting with ‘aba’ | Theory of computation in Hindi video
62. TOC#07 | Draw a DFA accepting strings starting with ‘aa’ | Theory of computation in Hindi video
63. TOC#08 | Draw a DFA starting with ‘aa’ or ‘bb’ | Theory of computation in Hindi video
64. TOC#09 | Draw a DFA ending with ‘ab’ | Theory of computation in Hindi video
65. TOC#10 | Draw a DFA ending with ‘abb’ | Theory of computation in Hindi video
66. TOC#11 | DFA for the language {w/w contains the substring abab} | Theory of computation in Hindi video
67. TOC#12 | Minimization of DFA | Theory of computation in Hindi video
68. TOC#13 | NFA accepting strings starting with a | Theory of computation in Hindi video
69. TOC#14 | Draw a NFA for strings starting with ‘ab’ | Theory of computation in Hindi video
70. TOC#15 | Design a NFA for {c b a bn } | Theory of computation in Hindi video
71. TOC#16 | Construct a finite automata for language {0n | n mod 3 = 2, n ≥ 0} | TOC in Hindi video
72. TOC#17 | Design a Finite Automata which accepts set of strings containing four 1’s | Theory of computation
73. TOC#18 | Draw a NFA and DFA for the language accepting strings ending with ‘aa’ in Hindi video
74. TOC#19 | Draw a NFA and convert to DFA for the language accepting strings ending with ‘b’ in Hindi video
75. TOC#20 | NFA to DFA conversion example 2 | Automata |Theory of computation in Hindi video
76. TOC#21 | NFA to DFA conversion example 03 | subset conversion methods | TOC in Hindi video
77. TOC#22 | Mealy to Moore Conversion | Theory of computation in Hindi video
78. TOC#23 | Moore to Mealy conversion | Theory of computation in Hindi video
79. TOC#24 | DFA NFA accepting string ending with 00 and 11 | Theory of computation in Hindi video
80. TOC#25 | Regular Expression in TOC | Theory of computation in Hindi video
81. TOC#26 | Regular Expression examples | TOC in Hindi video
82. TOC#27 | Regular Expression to NFA example 01 | TOC in Hindi video
83. TOC#28 | Regular Expression to NFA solved examples 02 | TOC in Hindi video
84. TOC#29 | Arden’s Theorem proved | TOC in Hindi video
85. TOC#30 | Ardens Theorem solved examples | Regular Expression from Automata in Hindi video
86. TOC#31 | What is CFG | Context Free Grammar | Theory of computation in Hindi video
87. TOC#32 | Construct CFG for language having any number of a | Context Free Grammar in Hindi video
88. TOC#33 | Derivation Tree, left most, right most, solved examples | TOC in Hindi video
89. TOC#34 | Left most and Right most derivation in TOC in Hindi video
90. TOC#35 | Derivation from Grammar examples in TOC in hindi video
91. TOC#36 | Ambiguity in Grammar examples 01 | CFG | TOC in Hindi video
92. TOC#37 | Ambiguity in Grammar Solved Examples 02 | CFG in Hindi video
93. TOC#38 | Ambiguity in Grammar Solved Examples 03 | CFG | TOC in Hindi video
94. TOC#39 | Equivalent Grammar Solved Examples in TOC in Hindi video
95. TOC#40 | Equivalent grammar solved examples 02 in TOC in Hindi video
96. TOC#41 | Chomsky’s Normal Form (CNF) in Hindi video
97. TOC#42 | CFG to CNF Conversion in TOC in Hindi video
98. TOC#43 | CFG to CNF coversion solved example in Hindi video | TOC
99. TOC#44 | Grammar to CNF conversion solved examples in Hindi video | TOC
100. TOC#45 | GREIBACH NORMAL FORM (GNF) in TOC in Hindi video
101. TOC#46 | Simplify the grammar, removal of null production with solved examples | TOC in Hindi video
102. TOC#47 | Convert CFG to LMD, RMD, Parse tree with solved examples in Hindi video | TOC
103. TOC#48 | Convert CFG Grammar to NFA to DFA | TOC in Hindi video
104. TOC#49 | Pushdown Automata explained, PDA Examples in Hindi video | TOC
105. TOC#50 | Difference between Regular Grammar regular expression repression regular languages in TOC in Hindi video
106. TOC#51 | JFLAP | TOC in Hindi video
107. TOC#52 | Design a Turing machine using JFLAP | TOC in Hindi video
108. Introduction to Automata Theory