#### RGPV 2010

Construct a finite automta that will accept those strings of a binary number that are divisible ny three.

or

#### RGPV 2009

construct DFA for binary integer divisible by 3

**Ans.**Some example strings = {0, 11, 110, 1001, 1100}

Minimum number of states required = 4

### Related posts:

- DFA accept even 0 and even 1 |RGPV TOC PYQ
- DFA ending with 00 start with 0 no epsilon | RGPV TOC PYQ
- DFA ending with 101 | RGPV TOC PYQ
- Construct DFA for a power n, n>=0 || RGPV TOC
- NFA to DFA | RGPV TOC
- Moore to Mealy | RGPV TOC PYQ
- RGPV TOC What do you understand by DFA how to represent it
- RGPV short note on automata
- RGPV TOC properties of transition functions
- RGPV TOC What is Trap state
- CFL are not closed under intersection
- Short note on automata | RGPV TOC PYQ
- Construct DFA equivalent to NFA | RGPV TOC PYQ
- RGPV Define Mealy and Moore Machine
- RGPV TOC Short note on equivalent of DFA and NFA
- RGPV notes Write short note on NDFA
- CNF from S–>aAD;A->aB/bAB;B->b,D->d.
- NDFA accepting two consecutive a’s or two consecutive b’s.
- Regular expresion to CFG
- Regular expression to Regular grammar
- Grammar is ambiguous. S → aSbS|bSaS|∈
- leftmost and rightmost derivations
- Construct Moore machine for Mealy machine
- Definition of Deterministic Finite Automata
- Notations for DFA
- How do a DFA Process Strings?
- DFA solved examples
- Definition Non Deterministic Finite Automata
- Moore machine
- Mealy Machine
- Regular Expression Examples
- Regular expression
- Arden’s Law
- NFA with ∈-Moves
- NFA with ∈ to DFA Indirect Method
- Define Mealy and Moore Machine
- What is Trap state ?
- Equivalent of DFA and NFA
- Properties of transition functions
- Mealy to Moore Machine
- Moore to Mealy machine
- Diiference between Mealy and Moore machine
- Pushdown Automata
- Remove ∈ transitions from NFA
- TOC 1
- Diiference between Mealy and Moore machine
- What is Regular Expression
- What is Regular Set in TOC
- DFA which accept 00 and 11 at the end of a string
- DFA end with 1 contain 00 | RGPV TOC draw
- RGPV TOC design finite automata problems
- Minimization of DFA
- Construct NFA without ∈
- RGPV TOC PYQs
- Introduction to Automata Theory