Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
question a what is backus-naur formb give an example of the backus-naur form of the grammar for a subset of english of
question a define a type 1 grammarb give an example of a grammar that is not a type 1 grammarc define a type 2 grammard
question a what is the language generated by a phrase-structure grammar gb what is the language generated by the
question a define a phrase-structure grammarb what does it mean for a string to be derivable from a string w by a
question show that b2 is at least 4 by finding a turing machine with two states and alphabet 1 b that halts with four
question which of the following problems is a decision problema is the sequence a1 a2an of positive integers in
question which of the following problems is a decision problema what is the smallest prime greater than nb is a graph g
question by finding the composite of the turing machines you constructed in exercises 18 and 22 construct a turing
question a define a finite-state automatonb what does it mean for a string to be recognized by a finite-state
question construct a turing machine with tape symbols 0 1 and b that given a bit string as input replaces all but the
question construct a turing machine with tape symbols 0 1 and b that given a bit string as input replaces all 0s on the
question construct a turing machine with tape symbols 0 1 and b that when given a bit string as input replaces the
question construct a turing machine with tape symbols 0 1 and b that when given a bit string as input adds a 1 to the
question construct a turing machine that computes the function f n n mod 3 for every nonnegative integer
question construct a turing machine that computes the function f n 3 if n ge 5 and f n 0 if n 0 1 2 3 or
question construct a turing machine that computes the function f n 2n for all nonnegative integers
question suppose that l is a subset of i lowast and for some positive integer n there are n strings in i lowast such
question let ln be the set of strings with at least n bits in which the nth symbol from the end is a 0 use exercise to
question use exercise to show that the language consisting of all bit strings that are palindromes that is strings that
question show that the set 02n1n n 0 1 2 is not regular using the pumping lemma given in exerciseexercise one
question one important technique used to prove that certain sets are not regular is the pumping lemma the pumping lemma
question let m s i f s0f be a deterministic finite-state automaton show that the language recognized by m lm is
question show that every nondeterministic finite-state automaton is equivalent to another such automaton that has the
question show that the regular grammar constructed from a finitestate automatonfsa in the proof of theorem generates
question construct a regular grammar g v t s p that generates the language recognized by the given finite-state