Question

Please answer True or False on the following: 1. Let L be a set of strings...

Please answer True or False on the following:

1. Let L be a set of strings over the alphabet Σ = { a, b }. If L is infinite, then L* must be infinite (L* is the Kleene closure of L)

2. Let L be a set of strings over the alphabet Σ = { a, b }. Let ! L denote the complement of L. If L is finite, then ! L must be infinite.

3. Let L be a set of strings over the alphabet Σ = { a, b }. Let ! L denote the complement of L. If L is infinite, then ! L must be finite.

4. Let L be a set of strings over the alphabet Σ = { a, b }. If L is finite, then L* must be infinite.

Homework Answers

Answer #1

1. Let L be a set of strings over the alphabet Σ = { a, b }. If L is infinite, then L* must be infinite (L* is the Kleene closure of L)false

2. Let L be a set of strings over the alphabet Σ = { a, b }. Let ! L denote the complement of L. If L is finite, then ! L must be infinite.true

3. Let L be a set of strings over the alphabet Σ = { a, b }. Let ! L denote the complement of L. If L is infinite, then ! L must be finite. true

4. Let L be a set of strings over the alphabet Σ = { a, b }. If L is finite, then L* must be infinite. false

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let S denote the set of all possible finite binary strings, i.e. strings of finite length...
Let S denote the set of all possible finite binary strings, i.e. strings of finite length made up of only 0s and 1s, and no other characters. E.g., 010100100001 is a finite binary string but 100ff101 is not because it contains characters other than 0, 1. a. Give an informal proof arguing why this set should be countable. Even though the language of your proof can be informal, it must clearly explain the reasons why you think the set should...
1.2 Which of the following statements is wrong?        a). A set is a subset of itself...
1.2 Which of the following statements is wrong?        a). A set is a subset of itself        b). Emptyset is a subset of any set        c). A set is a subset of its powerset        d). The cardinality of emptyset is 0 1.3. Which of the following statements is correct?        a). A string is a set of symbols from an alphabet        b). The length of the concatenation of two strings can           be the same as one of them        c). The length of...
1. [10 marks] We begin with some mathematics regarding uncountability. Let N = {0, 1, 2,...
1. [10 marks] We begin with some mathematics regarding uncountability. Let N = {0, 1, 2, 3, . . .} denote the set of natural numbers. (a) [5 marks] Prove that the set of binary numbers has the same size as N by giving a bijection between the binary numbers and N. (b) [5 marks] Let B denote the set of all infinite sequences over the English alphabet. Show that B is uncountable using a proof by diagonalization.
Let s and p be two particular strings over an alphabet Σ. Prove that the following...
Let s and p be two particular strings over an alphabet Σ. Prove that the following language M = {w ∈ Σ ∗ | w contains u as a substring but does not contain v as a substring} is regular. plz provide DFA and also simplified the DFA thx !
Design deterministic finite automata for each of the following sets: 1) The set of strings x...
Design deterministic finite automata for each of the following sets: 1) The set of strings x ε {0, 1}* such that #0(x) is even and #1(x) is a multiple of three. 2) The set of all strings in {1, 2, 3}* containing 231 as substring. 3) The set of strings in (a)* whose length is divisible by either 2 or 7.
1. Define a deterministic finite automaton over the alphabet {a, b} which accepts the set of...
1. Define a deterministic finite automaton over the alphabet {a, b} which accepts the set of all strings that end with the substring ab or ba.
Let L be any non-empty language over an alphabet Σ. Show that L^2⊆L^3 if and only...
Let L be any non-empty language over an alphabet Σ. Show that L^2⊆L^3 if and only if λ∈L.
Let F be the set of all finite languages over alphabet {0, 1}. Show that F...
Let F be the set of all finite languages over alphabet {0, 1}. Show that F is countable
Please answer True or False for the following statements: 1.) In hypothesis testing, if the null...
Please answer True or False for the following statements: 1.) In hypothesis testing, if the null hypothesis is rejected, then the alternative or motivated hypothesis must also be rejected. 2.) Under certain conditions, binomial distributions can be approximated by normal distributions. 3.) Using a normal distribution to approximate binomial probabilities is extremely accurate, but takes an excessive amount of time and should be avoided. 4.) A bell-shaped curve is still normal, even if the mean, median, and mode are not...
Let X be a set and let F1,F2 ⊆ P(X) be two σ-algebras on X. Let...
Let X be a set and let F1,F2 ⊆ P(X) be two σ-algebras on X. Let G := {A ∩ B | A ∈ F1, B ∈ F2}. Prove the following statements: (1) G is closed under finite intersections. (2) σ(G) = σ(F1 ∪ F2).
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT