on A language L is called slithy if it contains at least two strings and has the following property: For every two strings x, y in L such that |x|

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
on
A language L is called slithy if it contains at least two strings and has the following property:
For every two strings x, y in L such that |x|< lyl, the string obtained by taking the first letter of y
and inserting it at the start of x is also in L.
For example, if L contains aaa and baaba, then it must also contain the string baaa.
Prove by contradiction that every slithy language contains two strings of the same length.
Transcribed Image Text:on A language L is called slithy if it contains at least two strings and has the following property: For every two strings x, y in L such that |x|< lyl, the string obtained by taking the first letter of y and inserting it at the start of x is also in L. For example, if L contains aaa and baaba, then it must also contain the string baaa. Prove by contradiction that every slithy language contains two strings of the same length.
Expert Solution
Step 1

Let's imagine there's a slithy language L that has two strings x and y with differing lengths, say Ixl Iyl. Let's also claim that L has both of these strings. According to the definition of a slithy language, the string that is formed by taking the first letter of y and putting it at the beginning of x is also in L. This is because the first letter of y is inserted at the beginning of x. However, the length of this new string, Iyl, is greater than the length of the previous string, Ixl, which contradicts the premise that x and y have distinct lengths. Because of this, each and every slithy language has to have two strings that are exactly the same length.

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY