The set of all strings over the alphabet S = {a, b} (including e) is denoted...

Question

Question

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*

engineering Computer-Science

Answer 1

Answer #1

a. (a + b)*

answered by: object

Answer 2

Similar Homework Help Questions

(5) Describe the strings in the set S of strings over the alphabet Σ = a,...

(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...
Construct an DFA automaton that recognizes the following language of strings over the alphabet {a,b}: the...

Construct an DFA automaton that recognizes the following language of strings over the alphabet {a,b}: the set of all strings over alphabet {a,b} that contain aa, but do not contain aba.
Let Hn denote the set of strings over the alphabet {A, B, C} with no two...

Let Hn denote the set of strings over the alphabet {A, B, C} with no two consecutive letters the same. Let hn = |Hn|. Determine H1, H2, H3, and then find a recurrence for hn. Solve the recurrence relation you found.

Problem 3 a) How many strings are there of length 10 over the alphabet (a, b)...

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?
Construct a regular expression that recognizes the following language of strings over the alphabet {0 1}:...

Construct a regular expression that recognizes the following language of strings over the alphabet {0 1}: The language consisting of the set of all bit strings that contain two or three symbols.
Discrete Math Design an automation with the given alphabet that accepts the given set of strings:...

Discrete Math Design an automation with the given alphabet that accepts the given set of strings: Input alphabet = {0, 1}; Accepts the set of all strings that end in 10.

(a) Consider the alphabet Σ = {a, b, c}. Give a recursive definition for the set...

(a) Consider the alphabet Σ = {a, b, c}. Give a recursive definition for the set of strings over Σ that contain exactly one c. (b) Give a recursive definition for the set S = {x | x ∈ Z≥0 and b x 4 c is even}
Construct regular expressions for the following languages over the alphabet {a, b}: a. Strings that do...

Construct regular expressions for the following languages over the alphabet {a, b}: a. Strings that do not begin with an “a”. b. Strings that contain both aa and bb as substrings.
2. 9 marks] Strings. Consider the following definitions on strings Let U be the set of all strings Let s be a str...

2. 9 marks] Strings. Consider the following definitions on strings Let U be the set of all strings Let s be a string. The length or size of a string, denoted Is, is the number of characters in s Let s be a string, and i e N such that 0 < ί < sl. We write s[i] to represent the character of s at index i, where indexing starts at 0 (so s 0] is the first character, and...

Let Σ = {0, 1). (a) Give a recursive definition of Σ., the set of strings from the alphabet Σ. (b) Prove that for every n E N there are 2" strings of length n in '. (c) Give a recursive d...

Let Σ = {0, 1). (a) Give a recursive definition of Σ., the set of strings from the alphabet Σ. (b) Prove that for every n E N there are 2" strings of length n in '. (c) Give a recursive definition of I(s), the length of a string s E Σ For a bitstring s, let O(s) and I(s) be number of zeroes and ones, respectively, that occur in s. So for example if s = 01001, then 0(s)...