Chapter 0: Q18P (page 1)
Let is a regular expression with exponentiation and }. Show that .
Short Answer
The above problem is solved by using i.e., the problem of any -complete cannot be in .
Chapter 0: Q18P (page 1)
Let is a regular expression with exponentiation and }. Show that .
The above problem is solved by using i.e., the problem of any -complete cannot be in .
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 two-dimensional finite automaton (2DIM-DFA) is defined as follows. The input is an rectangle, for any m,n. The squares along the boundary of the rectangle contain the symbol # and the internal squares contain symbols over the input alphabet . The transition function indicates the next state and the new head position (Left, Right, Up, Down). The machine accepts when it enters one of the designated accept states. It rejects if it tries to move off the input rectangle or if it never halts. Two such machines are equivalent if they accept the same rectangles. Consider the problem of determining whether two of these machines are equivalent. Formulate this problem as a language and show that it is undecidable.
For each of the following languages, give two strings that are members and two strings that are not members—a total of four strings for each part. Assume the alpha-alphabet in all parts.
Let X be the set and Y be the set .The unary function and the binary function are described in the following tables.
a. What is the value of ?
b.What are the range and domain of f?
c. What is the value of g (2, 10) ?
d. What are the range and domain ofg?
e. What is the value ofg(4, f (4))?
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.
What do you think about this solution?
We value your feedback to improve our textbook solutions.