CameraIcon

SearchIcon

MyQuestionIcon

1

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

Let L be the ...

Question

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

Open in App

Solution

The number of states in the minimum state deterministic finite state automation accepting all binary strings whose last two symbols are the same is 5.

Suggest Corrections

thumbs-up

0

Similar questions

Let w be any string of length n in {0, 1}^{*} .

Let L be the set of all substrings of w.

What is the minimum number of states in

a non-deterministic finite automaton that accepts L?

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

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

Q. Let M be a deterministic finite automata as shown below;

Let S denote the set of 7-bit binary strings in which the first, the third and the last bits are 1. The number of strings in S that are accepted by M is equal to_____.

Q. Let M be a deterministic finite automata as shown below:

Let S denote the set of 7 bit binary strings in which the first, the fourth and the last bits are 1. The number of strings in S that accepted by M is equal to

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Evolutionary Relationships_Tackle

Watch in App

Join BYJU'S Learning Program

CrossIcon