. Describe a TM that enumerates all even-length strings for a unary alphabet
(0o,R) (0,0,R JOBB,R) if o come ad to then Leave it and move to Right reached a 4 is odd longth 20 es even length. of again a' come at 2, more to to like wise all even length stings. Accept
. Describe a TM that enumerates all even-length strings for a unary alphabet
Construct a Turing machine with input alphabet {?, ?}, which accepts strings of even length.
Let n be an even number. How many ternary strings (i.e. strings over the alphabet 10, 1,2]) of length n are there in which the only places that zeroes can appear are in the odd-numbered positions?
Question 1 - Regular Expressions Find regular expressions that define the following languages: 1. All even-length strings over the alphabet {a,b}. 2. All strings over the alphabet {a,b} with odd numbers of a's. 3. All strings over the alphabet {a,b} with even numbers of b’s. 4. All strings over the alphabet {a,b} that start and end with different symbols. 5. All strings over the alphabet {a, b} that do not contain the substring aab and end with bb.
Problem 3 a) How many strings are there of length 10 over the alphabet (a, b) with exactly five a's? b) How many strings are there of length 10 over the alphabet (a, b, c) with exactly five a's?
Formally describe a 2-tape deterministic Turing Machine that accepts strings on the {0,1} alphabet. Such strings have the number of "0" double than "1".
(5) Describe the strings in the set S of strings over the alphabet Σ = a, b, c defined recursively by (1) c E S and (2) if x є S then za E S and zb є S and cr є S. Hint: Your description should be a sentence that provides an euasy test to check if a given string is in the set or not. An example of such a description is: S consists of all strings of...
****** Theory of Computing ********* 1. Provide a regular expression for “all even length strings of b’s”. 2. List all words of length 4 in Language((a+b)* a). Also, provide an English description of this language.
Write a context-free grammar for the language where all strings are of even length and the first half of the string is all 0’s, but it must be an odd number of 0’s
III. ASSIGNMENT 2.1 As discussed in class, the example program enumerates all possible strings (or if we interpret as numbers, numbers) of base-b and a given length, say l. The number of strings enumerated is b l . Now if we interpret the outputs as strings, or lists, rather than base-b numbers and decide that we only want to enumerate those strings that have unique members, the number of possible strings reduces from b l to b!. Furthermore, consider a...
The set of all strings over the alphabet S = {a, b} (including e) is denoted by a. (a + b)* b. (a + b)+ c. a+b+ d. a*b*