FA 1 - CS0023 || CANVAS

Which of the following sets best represents an alphabet of natural numbers in base 7?

Group of answer choices

{0, 1, 2, 3, 5, 6, 7}

{0, 1, 2, 3, 4, 5, 7}

{0, 1, 2, 3, 4, 6, 7}

{0, 1, 2, 3, 4, 5, 6}

{0, 1, 2, 3, 4, 5, 6}

Which of the following sets best represents an alphabet suitable for describing the detailed workings of a computer?

Group of answer choices

{2, 0}

{0,0 }

{0, 1}

{0, 2}

{0, 1}

Consider the string u = abab over the alphabet {a, b}. Which of the following strings is a substring of u?

Group of answer choices

ab

All of the given choices

abb

bb

ab

Consider the string w = aardvark over the alphabet {a, …, z}. Which of the following sets of strings is the set of prefixes for w

Group of answer choices

{a, aa, aar, aard}

{a, aa, aar, ark}

{a, aa, aard, vark}

{a, aa, aar, rk}

{a, aa, aar, aard}

Consider the string w = aardvark over the alphabet {a, …, z}. Which of the following sets of strings is the set of suffixes for w.

Group of answer choices

{dvark, k, rk, ark}

{aa, k, rk, vark}

{kk, rk, rak, vark}

{rk, rkk, vark, k}

{dvark, k, rk, ark}

Consider the string w = aardvark over the alphabet {a, …, z}. Which of the following sets is a set of factors with length 2?

Group of answer choices

{aa, ar, rd, va, kk}

{aa, ar, rd, va, ak}

{aa, ar, rd, va, rk}

{aa, ar, rd, va, kr}

{aa, ar, rd, va, rk}

Consider the string w = aardvark over the alphabet {a, …, z}. Which of the following sets is a set of factors with length 3?

Group of answer choices

{aar, ard, rdv, dva, ark}

{aar, ard, rdv, dva, rkv}

{aar, ard, rdv, dva, rkr}

{aar, ard, rdv, dva, rrk}

{aar, ard, rdv, dva, ark}

Let L = {ab, ba} and M = {aa, ab}. What is LM?

Group of answer choices

LM = {abba, aaab, baba, bbaa}

LM = {aaab, baba, abba, bbaa}

LM = {abaa, abab, baaa, baab}

LM = {abaa, abba, bbaa, baba}

LM = {abaa, abab, baaa, baab}

Let L = {ab, ba} and N = {a, b}. What is LN?

Group of answer choices

LN = {aba, abb, baa, aab}

LN = {aba, abb, baa, bab}

LN = {aba, abb, baa, abb}

LN = {aba, abb, baa, bba}

LN = {aba, abb, baa, bab}

Let M = {aa, ab} and N = {a, b}. What is MN?

Group of answer choices

MN = {aaa, aab, aba, bab}

MN = {aaa, aab, aba, abb}

MN = {aaa, aab, aba, bba}

MN = {aaa, aab, aba, bbb}

MN = {aaa, aab, aba, abb}

Which of the following DFA diagrams is represented by the following transition table?

 

Option1.

  Option 2.

Option 3.

  Option 4.

Group of answer choices

Option 2

Option 3

Option 1

Option 4

Option 1

Which of the following transition tables is represented by the following state diagram?

Option 1.

          Option 2.

 Option 3.

          Option 4.  

 

Group of answer choices

Option 4

Option 2

Option 1

Option 3

Option 1

Which of the following strings is NOT accepted by the following DFA?

Group of answer choices

10010

00001

11110

10001

00001

Which of the following state diagrams is the correct DFA for the language accepting strings ending with ’01’ over input alphabets ∑ = {0, 1} ?

Option 1.

     Option 2.

Option 3.

     Option 4.

 

 

 

 

Group of answer choices

Option 2

Option 3

Option 4

Option 1

Option 1

Given the following state diagram, what sequence of states does the machine go through on input aabba?

Group of answer choices

a

b

d

c

a

The DFA extended transition function was used to check the acceptability of the string abba. The state diagram and solution steps are shown below.

What will be the entry in the solution for (1)?

Group of answer choices

b

c

a

d

c

What is the formal definition of the following DFA?

a. M = ({q0, q1, q2}, {a, b}, δ, q0, {q0})
b. M = ({q0, q1, q2}, {a, b}, δ, q0, {q2})
c. M = ({q0, q1, q2}, {a, b}, δ, q0, {q1})
d. M = ({q0, q1, q2}, {a, b}, δ, q1, {q2})

Group of answer choices

b

c

d

a

b

What is the transition function format of the following DFA?

Option 1.

     Option 2.  

     Option 3.

     Option 4.

 

 

 

Group of answer choices

Option 4

Option 3

Option 2

Option 1

Option 1

Which of the following strings is accepted by the DFA represented by the transition table below?

 

Group of answer choices

babbb

aabba

abbaa

babaa

aabba

Which of the following strings is accepted by the following DFA?

Group of answer choices

aaaa

baabb

aaabb

baaba

baaba

Which of the following state diagrams best represents the following DFA definition?

Option 1.

   Option 2.

Option 3.

     Option 4.

 

Group of answer choices

Option 2

Option 4

Option 3

Option 1

Option 1

Given the state diagram below, which of the following transition functions best describe said DFA?

Option 1.

     Option 2.

     Option 3.

     Option 4.

 

 

 

 

Group of answer choices

Option 2

Option 3

Option 1

Option 4

Option 1

What does the following figure below represent?

Group of answer choices

Final state with loop x

Initial state as well as final state with loop x

Transitional state with loop x

Insufficient Data

Initial state as well as final state with loop x

Which of the following will not be accepted by the following DFA?

 

Group of answer choices

abbbaa

abbaabbaa

ababaabaa

abbbaabb

ababaabaa

Which of the following will the given DFA won’t accept?

Group of answer choices

ε

String of letter count 11

10001010

11010

ε