Chapter 0: Q3E (page 26)
LetAbe the setandbe the set.
- IsAa subset ofB?
- IsBa subset ofA?
- What is?
- What is?
- What is?
- What is the power set ofB ?
Short Answer
a. No, A is not a subset of B.
b. Yes, B is a subset of A.
c.
d.
e.
f. Power set of B is
Chapter 0: Q3E (page 26)
LetAbe the setandbe the set.
a. No, A is not a subset of B.
b. Yes, B is a subset of A.
c.
d.
e.
f. Power set of B is
All the tools & learning materials you need for study success - in one app.
Get started for freeLet be strings and let L be any language. We say that x and y are distinguishable by L if some string Z exists whereby exactly one of the strings is a member of L ; otherwise, for every string z , we have whenever and we say that are indistinguishable by L. If are indistinguishable by L, we write x ≡L y. Show thatis an equivalence relation.
A queue automaton is like a push-down automaton except that the stack is replaced by a queue. A queue is a tape allowing symbols to be written only on the left-hand end and read only at the right-hand end. Each write operation (we’ll call it a push) adds a symbol to the left-hand end of the queue and each read operation (we’ll call it a pull) reads and removes a symbol at the right-hand end. As with a PDA, the input is placed on a separate read-only input tape, and the head on the input tape can move only from left to right. The input tape contains a cell with a blank symbol following the input, so that the end of the input can be detected. A queue automaton accepts its input by entering a special accept state at any time. Show that a language can be recognized by a deterministic queue automaton iff the language is Turing-recognizable.
Give a formal definition of an enumerator. Consider it to be a type of two-tape Turing machine that uses its second tape as the printer. Include a definition of the enumerated language
Question: Describe the error in the following “proof” that is not a regular language. (An error must exist because is regular.) The proof is by contradiction. Assume that is regular. Let p be the pumping length for localid="1662103472623" given by the pumping lemma. Choose s to be the string 0p1p . You know that s is a member of 0*1*, but Example 1.73 shows that s cannot be pumped. Thus you have a contradiction. So is not regular.
Using the solution you gave to Exercise 1.25, give a formal description of the machines and depicted in Exercise 1.24
What do you think about this solution?
We value your feedback to improve our textbook solutions.