Question

1.2 Which of the following statements is wrong?        a). A set is a subset of itself...

1.2 Which of the following statements is wrong?

       a). A set is a subset of itself

       b). Emptyset is a subset of any set

       c). A set is a subset of its powerset

       d). The cardinality of emptyset is 0

1.3. Which of the following statements is correct?

       a). A string is a set of symbols from an alphabet

       b). The length of the concatenation of two strings can

          be the same as one of them

       c). The length of a string is at least 1

       d). The concatenation of prefix and suffix of a string

  is itself

1.4 Which of the followings describe the regular expression    

       a). Any strings over alphabet  

       b). Any strings of even length over alphabet  

       c). , i.e., any strings consisting of two

          identical symbols

       c). , i.e., any strings consisting of an

          even number of identical symbols

1.5. Consider the following DFA

Which of the followings describes its language over ?

   a). All string that contain at most two a's

   b). All string that contain at least two a's

   c). All string that contain exactly two a's

   d). All strings that does not contain two a's  

1.6 Which of the following statements is correct?

       a). If and are both regular languages,  

          , then is also a regular language   

       b). If and are both regular languages, then

           is also a regular language

       c). If and are both regular languages,

          , then is also a regular language

        d). If and are both regular languages,

          , then is also a regular language   

1.7 Let be a regular language over alphabet . Which of the followings is correct?  

        a). It is possible that any subset of is not regular

        b). All strings of that has an even length is regular

        c). It is possible that for any , , is

        not regular

        d). The set of all strings that is formed by the

        concatenation of strings in may be nonregular

  1.8 Which of the followings is wrong?    

        a). A nondeterministic finite automaton is also a

        deterministic finite automaton.

        b). A deterministic finite automaton is also a

        nondeterministic finite automaton

        c). If a language is regular, then there exists a

        deterministic finite automaton such that the set of

        strings it accepts is exactly .  

        d). If a language is regular, then there exists a

        deterministic finite automaton such that the set of

        strings it does not accept is exactly .  

1.9 Consider the following NFA

Which of the following strings is not accepted by it?

      a).  

      b).   

      c).  

      d).  

1.10 Which of the following statement is wrong?

      a). The intersection of two non-regular languages can

      be regular.

      b). The union of two non-regular languages can be

      regular.

      c). The concatenation of two non-regular languages

      can be regular.

      d). The complement of a non-regular language can be

      regular.

Homework Answers

Answer #1

1.2) b.

A set is a subset of itself and it's power set. The cardinality of empty set is zero.

1.3)d.

The length of concatenation of two strings is not the same as one of them and it is not necessary for the length of a string to be at least 1.A string is a finite set of symbols taken from alphabet.

1.4)a

Any strings which consists of an even number of identical symbols or has two identical symbols or is of even length over alphabet is not neccessarily a regular expression.

1.5)Insufficient Data

PLEASE LIKE THE ANSWER IF YOU FIND IT HELPFUL OR YOU CAN COMMENT IF YOU NEED CLARITY / EXPLANATION ON ANY POINT.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Find a regular expression to describe: The set of all strings over the alphabet {a, b,...
Find a regular expression to describe: The set of all strings over the alphabet {a, b, c, d} that contain exactly one a and exactly one b So, for example, the following strings are in this language: ab, ba, cccbad, acbd, cabddddd, ddbdddacccc and the following strings are NOT in this language: a, ccbc, acbcaaacba, acacac, bcbbbbbca, aca, c, d, b
Automata Theory and Formal Languages Instructions: Draw the DFA (Deterministic Finite Automaton) of the following: DFA...
Automata Theory and Formal Languages Instructions: Draw the DFA (Deterministic Finite Automaton) of the following: DFA which accepts strings of odd length Design a DFA over w ∈ {a,b}*such that number of a = 2 and there is no restriction over length of b DFA for Number of a(w) mod 2 = 0 and Number of b(w) mod 2 = 0 DFA for Number of a(w) mod 2 = 0 orNumber of b(w) mod 2 = 0 DFA for Number...
Which one of the following languages over the alphabet {0,1} is described by the regular expression...
Which one of the following languages over the alphabet {0,1} is described by the regular expression (0+1)* 0 (0+1)* 0 (0+1)* ? a.The set of all strings that begin and end with either 0 or 1 b.The set of all strings containing at most two zeros c.The set of all strings containing at least two zeros. d.The set of all strings containing the substring 00
4. Prove the Following: a. Prove that if V is a vector space with subspace W...
4. Prove the Following: a. Prove that if V is a vector space with subspace W ⊂ V, and if U ⊂ W is a subspace of the vector space W, then U is also a subspace of V b. Given span of a finite collection of vectors {v1, . . . , vn} ⊂ V as follows: Span(v1, . . . , vn) := {a1v1 + · · · + anvn : ai are scalars in the scalar field}...
Using the real numbers as the model, which of the following are true and which are...
Using the real numbers as the model, which of the following are true and which are not true? a. Some finite point set has a limit point. b. Any infinite number set M has a limit point. c. Any subset of (a, b) has a limit point. d. All limit points of a given set belong to the set. --------------------------------------------------------------------------------------------- Definition. A point p is said to be a limit point of a point set M if and only if...
In the following C code, Which variable if NOT of primitive data type? A. a B....
In the following C code, Which variable if NOT of primitive data type? A. a B. b C. c D. d int a = 10; double b = 20.0; float c = false; char d[5] = "Hello"; // here we define a string In programming language C, the implementation of a string data type is limited dynamic length, which means the length of a string variable is fixed once it has been defined. A. True B. False In C# programming...
1. Why does the existence of pidgins support a language bioprogram or universal core to language?...
1. Why does the existence of pidgins support a language bioprogram or universal core to language? a. these are languages created by deaf children and are gestural. b. these are languages that came from primitive cultures that are simple but contain all the elements of the definition for language. c. these are created languages that could not be acquired from hearing language. d. these are languages that developed without contact with any human language 2. What other evidence besides that...
Strings The example program below, with a few notes following, shows how strings work in C++....
Strings The example program below, with a few notes following, shows how strings work in C++. Example 1: #include <iostream> using namespace std; int main() { string s="eggplant"; string t="okra"; cout<<s[2]<<endl; cout<< s.length()<<endl; ​//prints 8 cout<<s.substr(1,4)<<endl; ​//prints ggpl...kind of like a slice, but the second num is the length of the piece cout<<s+t<<endl; //concatenates: prints eggplantokra cout<<s+"a"<<endl; cout<<s.append("a")<<endl; ​//prints eggplanta: see Note 1 below //cout<<s.append(t[1])<<endl; ​//an error; see Note 1 cout<<s.append(t.substr(1,1))<<endl; ​//prints eggplantak; see Note 1 cout<<s.find("gg")<<endl; if (s.find("gg")!=-1) cout<<"found...
Which of the following statements are true about properties of electric charge? Select all that apply....
Which of the following statements are true about properties of electric charge? Select all that apply. a) If two objects have the same magnitude of charge, the electric field lines that qualitatively describe the electric field of each object will be identical. b)A charged object will always exert a force on another charged object. c)An electron has a smaller magnitude of charge than a proton. d)Positive charges are repelled by negative charges. e)If an object is neutral, it means that...
Q1)Among the following control mode, which one would you choose to control the level of a...
Q1)Among the following control mode, which one would you choose to control the level of a process tank A. Manual B. P C. PI D. PID Q2) Explain the purpose of the second tank in a non-interacting set up Q3) In the cascade control set-up, which is the measured variable for the slave controller? Q4) In cascade controller, which of the loop (inner or outer) is a feed-forward loop? Explain why? Q5) For the non-interacting set-up with no controller, your...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT