   Chapter 12.1, Problem 1ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# In 1 and 2, let   ∑ = { x ,   y } be an alphabet.1. a. Let L 1 be the language consisting of all strings over that are palindromes and have length ∑ . List the elements of L 1 between braces. b. Let L 2 be the language consisting of all strings over ∑ that begin with an x and have length ≤ 3 . List the elements of L 3 .

To determine

(a)

List the elements of L1 between braces.

Explanation

Given information:

It is given that ={x,y}.

So, the symbols allowed are only x and y.

Concept used:

Palindrome: It refers to a string which reads the same whether in forward direction or in

backward direction.

Calculation:

Palindrome: It refers to a string which reads the same whether in forward direction or in

backward direction.

It is given that ={x,y}.

So, the symbols allowed are only x and y.

The length of the string is given to be 4.

The minimum length is not given. So, assume the minimum length of the string to be 0.

A string with length=0 is ε. Since, its length is 0, so, it doesn’t have a sense of forward or

Backward direction. So, ε is palindrome

To determine

(b)

List the elements of L2.

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 