Question

All strings of the form a^mb^n where m is even and n is odd. Question is:...

All strings of the form a^mb^n where m is even and n is odd. Question is: List the first 10 strings of the language in question above in canonical order

Homework Answers

Answer #1

From the question:

Language L = {am bn} where m is even and n is odd.

First 10 strings of the language canonical order:

1) m=0 and n=1 => a0 b1 = b

2) m=2 and n=1 => a2 b1 = aab

3) m=0 and n=3 => a0 b3 = bbb

4) m=4 and n=1 => a4 b1 = aaaab

5) m=2 and n=3 => a2 b3 = aabbb

6) m=0 and n=5 => a0 b5 = bbbbb

7) m=6 and n=1 => a6 b1 = aaaaaab

8) m=4 and n=3 => a4 b3 = aaaabbb

9) m=2 and n=5 => a2 b5 = aabbbbb

10) m=0 and n=7 => a0 b7 = bbbbbbb

Therefore the first 10 strings of the language L in canonical order = {b, aab, bbb, aaaab, aabbb, bbbbb, aaaaaab, aaaabbb, aabbbbb, bbbbbbb}

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
1. All questions assume the alphabet Σ = { a , b }. a) List the...
1. All questions assume the alphabet Σ = { a , b }. a) List the first 10 strings in canonical order of the language in question b above (even number of a's or odd number of b's, where the a's and b's can occur in any order). b) List the first 10 strings in canonical order of the language in question c above (ambn).
Prove the language of strings over {a, b} of the form (b^m)(a^n) , 0 ≤ m...
Prove the language of strings over {a, b} of the form (b^m)(a^n) , 0 ≤ m < n-2 isn’t regular. Use the pumping lemma for regular languages.
Prove the language of strings over {a, b} of the form (b^m)(a^n) , 0 ≤ m...
Prove the language of strings over {a, b} of the form (b^m)(a^n) , 0 ≤ m < n-2 isn’t regular. (I'm using the ^ notation but your free to make yours bman instead of (b^m)(a^n) ) Use the pumping lemma for regular languages.
Prove by either contradiction or contraposition: For all integers m and n, if m+n is even...
Prove by either contradiction or contraposition: For all integers m and n, if m+n is even then m and n are either both even or both odd.
Theorem: If m is an even number and n is an odd number, then m^2+n^2+1 is...
Theorem: If m is an even number and n is an odd number, then m^2+n^2+1 is even. Don’t prove it. In writing a proof by contraposition, what is your “Given” (assumption)? ___________________________ What is “To Prove”: _____________________________
Create a function that returns a boolean value if all-elements are not odd or even. Using...
Create a function that returns a boolean value if all-elements are not odd or even. Using Dr. Racket and the How to Design a Function (HtDF ) recipe, create a function that will return the following check-expect: (check-expect (all-elements? even? (list 1 2 3) false) (check-expect (all-elements? even? (list 2 4 6) true) (check-expect (all-elements? odd? (list 1 3 5) true) Can you find an element in the list where the predicate fails (return false)?
7. Prove by contradiction or contrapositive that for all integers m and n, if m +...
7. Prove by contradiction or contrapositive that for all integers m and n, if m + n is even then m and n are both even or m and n are both odd.
1.for all integer n amd m, if n-m is even then n^3-m^3 is even 2.) for...
1.for all integer n amd m, if n-m is even then n^3-m^3 is even 2.) for all int m, ifm>2 then m^2-4 is composite 3.) for all int ab c, if a|b and b|c then a|c prove true or give counterexample asap plz,
Compute the sum all even integers between m and n, inclusive. Assume m < n and...
Compute the sum all even integers between m and n, inclusive. Assume m < n and n, m > 0. Assume both m and n are even. show the steps please.
Problem 5 Regular Expressions. a) Define a regular expression for all strings of odd length, over...
Problem 5 Regular Expressions. a) Define a regular expression for all strings of odd length, over the alphabet of {0}. b) Define a regular expression for identifiers over the alphabet of {A,B,C,a,b,c,0,1,2,3,4,5,6,7,8,9}, such that an identifier must begin with an alphabetic character and must contain at least one numeric character. c) Try to modify the definition above so that identifiers still begin with an alphabetic character, but after that, it must contain at least one numeric, at least one lower-case...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT