* Theory Of Computing ****************** 1. Given the language “all even length strings of b’s” a....

Question

Question

*********************************** Theory Of Computing ****************************************************

1. Given the language “all even length strings of b’s”

a. Define this language using the listing method.

b. Define this language using the mathematical notation method.

c. Define this language using the recursive definition.

2. Provide a regular expression for “all even length strings of b’s”.

3. List all words of length 4 in Language((a+b)* a). Also, provide an English description of this language.

engineering Computer-Science

Answer 1

Answer #1

1.a) Listing method
{epsilon, bb, bbbb, bbbbbb, ...}

EXPLANATION: 0, 2, 4, 6, and so on lengths

1.b) Mathematical notation
{(bb)ⁿ | n >= 0}

1.c) Recursive definition
epsilon in S
If x is in S, then xbb is also in S

-- One question / 3 sub parts at a time please - T&C of Chegg

Answer 2

Similar Homework Help Questions

****** Theory of Computing ********* 1. Provide a regular expression for “all even length 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.
************Theory of Computing ***************** 1. Generate a regular expression of “all words over the alphabet Σ...

************Theory of Computing ***************** 1. Generate a regular expression of “all words over the alphabet Σ = {a b} that either begin with a and end with b OR begin with b and end in a.” Thus, the first few shortest words in this language are “ab” “ba” “aab” “baa” “abb” “bba” “aaab” etc. So, if a word begins with a it must in end b, and if it begins with b it must end in a. 2. Consider the...
Question 1 - Regular Expressions Find regular expressions that define the following languages: 1. All even-length...

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.

The “tail” of a language is deﬁned as the set of all suﬃxes of its strings....

The “tail” of a language is deﬁned as the set of all suﬃxes of its strings. That is, tail(L) = {y : xy ∈ L for some x ∈ Σ∗} (i). If L = {w ∈ {a, b}∗ : w contains exactly three b’s}, give a brief description of tail(L). (ii). Show that if L is any regular language, then tail(L) is also a regular language. As with Question 3, you can assume Σ = {a, b} if you like....
Theory of computation. Please show all work. Construct a TG for the language of all strings...

Theory of computation. Please show all work. Construct a TG for the language of all strings where characters in odd numbered positions (i.e., the 1^st, 3^rd, 5^th, etc. characters) must be the letter "a". convert your TG from problem 3 into a regular expression (show the steps that you take).
Write a context-free grammar for the language where all strings are of even length and the...

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

Construct a deterministic finite automaton accepting all and only strings in the language represented by the...

Construct a deterministic finite automaton accepting all and only strings in the language represented by the following regular expression: ((a U c)(b U c))* U = symbol for union in set theory
Automata theory Q1: Assume S = {a, b}. Build a CFG for the language of all...

Automata theory Q1: Assume S = {a, b}. Build a CFG for the language of all strings with a triple a in them. Give a regular expression for the same language. Convert the CFG into CNF grammar. Q2: Assume S = {a, b}. Build a CFG for the language defined by (aaa+b)*. Convert the CFG into CNF grammar. Q3: Explain when a CFG is ambiguous. Give an example of an ambiguous CFG. give vedio link also
Theory of Computation. Please show all work. Given the following FAs for the language {a} and...

Theory of Computation. Please show all work. Given the following FAs for the language {a} and {b}: construct the FA that is product for the language {a} +{b}. Show the transition table and draw the transition diagram convert your FA from problem 1(an FA is also a TG) into a regular expression (show the steps that you take).

John Doe claims that the language L, of all strings over the alphabet Σ = {...

John Doe claims that the language L, of all strings over the alphabet Σ = { a, b } that contain an even number of occurrences of the letter ‘a’, is not a regular language. He offers the following “pumping lemma proof”. Explain what is wrong with the “proof” given below. “Pumping Lemma Proof” We assume that L is regular. Then, according to the pumping lemma, every long string in L (of length m or more) must be “pumpable”. We...

*********************************** Theory Of Computing **************************************************** 1. Given the language “all even length strings of b’s” a....