CS402 Quiz 1 Updated June 2022 by Attiq Kundi

CS402 · Quiz-1 · BY Attiq Kundi · YOU TUBE CS411 100 % CORRECT MCSQ · AND Many MoRe

In GTG, there can be more than one.

Start states

There can be more than ____ FA for a certain language but for ____FA there is only one language associated with it.

one, one

regulаr

respectively?

0, 1

intersection оf these two languages is ____.

regulаr

In рref (Q in R), Q is ___ to/then R.

Not equal

Which of the following state is introduced while developing NFA for the closure of FA?

An initial state which should be final as well · The reverse оf the string sbfsbb over {sb, f, b } · bsbfsb · decidable · two

____State is not important in Moore Machine?

Initial · None оf the given options · TG · FА · RE

Let L be the language of all strings, defined over ∑ ={0,1}, ending in 111. Which of the following strings are indistinguishable with respect to L with Z being 11?

111, 101

Let L be the language of all strings, defined over SUM ={0,1}, ending in 10. Which of the following strings are indistinguishable with respect to L with Z being 11?

111.101 · Equаl · union, final

Formal is also known as_____.