CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Which of the ...

Question

Which of the following sets can be recognized by a Deterministic Finite State Automaton?

Open in App

Solution

The number 1, 2, 4, 8,..... $2^{n}$ .... are represented by 1, 10, 100, 1000......

The pattern in the regular expression is 1 followed by 0's

The regular expression for above is $10^{*}$

The DFA for above language is

So the numbers 1, 2, 4, 8,...... $2^{n}$ ..... written in binary can be recognized by a deterministic finite state automaton.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Let L be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite state automaton accepting L is

Q. The number of states in the minimal deterministic finite automaton corresponding to the regular expression is (0+1)*(10)

Q. Consider the regular expression :

R = (a + b)^{*} (a a + b b) (a + b)^{*}

Which deterministic finite automaton accepts the language represented by the regular expression R?

Q. Consider the regular grammar:

S

\to

∣

\to

\to

\to

\to

∣

ϵ

Where S is the starting symbol, the set of terminals is {a} and the set of non-terminals is { S, W, Y, Z}. We wish to construct a deterministic finite automaton (DFA) to recognize the same language. What is the minimum number of states required for the DFA?

Q. Consider the language L given by the regular expression

(a + b)^{*} b (a + b)

over the alphabet

{a, b}

. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting L is

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Evolutionary Relationships_Tackle

Watch in App

Join BYJU'S Learning Program

CrossIcon