RGPV 2020Construct a NDFA accepting all string in {a,b} with either two consecutive a’s or two consecutive b’s. Ans.

### Category: dfa nfa example

## RGPV TOC Short note on equivalent of DFA and NFA

RGPV 2010, 02Q. Write short note on equivalent of DFA and NDFA ? Ans. Every DFA is an NDFA. If from a regular set an NDFA is created than there may be chances of existence of DFA. DFA is 5 tuple machine: M = (Q, Σ, δ, q0, F) Q is a finite non empty […]

## RGPV TOC What do you understand by DFA how to represent it

RGPV 2015,14,02,03Q. What do you understand by DFA (Deterministic Finite Automata) and how is it represented ? Ans. A DFA means Deterministic finite automata or a finite state automata or a deterministic finite state machine (DFSM) or deterministic finite acceptor (DFA). It is a 5 tuple machine, M = (Q, Σ, δ, q0, F) Q is […]

## DFA which accept 00 and 11 at the end of a string

Construct a NDFA and DFA accepting string having 00 and 11 at the end of the string with input (0,1). Solution.