3. Let Σ₁ be the language over the alphabet {a}, Σ₂ be the language over the alphabet (a, b) and N be the set of natural numbers. Using a bijective function, • prove that | ₁* | = |N|. • prove that | ₂* | = |N|.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.1: Postulates For The Integers (optional)
Problem 12E: Let A be a set of integers closed under subtraction. a. Prove that if A is nonempty, then 0 is in A....
icon
Related questions
Question
3. Let Σ₁ be the language over the alphabet {a}, ₂ be the language over the alphabet (a, b) and N be the set of
natural numbers. Using a bijective function,
• prove that | ₁* | = |N|.
prove that |
₂* | = |N|.
Transcribed Image Text:3. Let Σ₁ be the language over the alphabet {a}, ₂ be the language over the alphabet (a, b) and N be the set of natural numbers. Using a bijective function, • prove that | ₁* | = |N|. prove that | ₂* | = |N|.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer