Chapter 13: Modeling Computation
Q29E
Which of the following problems is a decision problem
Q29SE
Construct a Turing machine that computes the function
Q2E
Describe in words the strings in each of these regular sets.
Q2E
Give the state tables for the finite-state machines with these state diagrams.
Q2E
Show that if A is a set of strings, then
Q2E
Let
a)
... B B 0 1 0 1 B B ...
b)
... B B 1 1 1 B B B ...
c)
... B B 0 0 B 0 0 B ...
d)
.... B B B B B B B B ...
Q2E
Find five other valid sentences, besides those given in Exercise 1.
Q2RE
a)what is the language generated by a phrase-structure grammar G?
b)What is the language generated by the grammar Gwith vocabulary{S,0,1}, set of terminals T= {0,1}, starting symbol S, and productions S→000S, S→1?
c)Give a phrase-structure grammar that generates the set
Q2SE
Find a phrase-structure grammar that generates the set
Q30E
Construct a deterministic finite-state automaton that recognizes the set of all bit strings that begin with 0 or with 11.