Example 3.15 Given a list of symbols a1, a2, …, am, a string of these symbols is: B1. the empty string, denoted by λ, or B2. any symbol ai, or   R. xy, the concatenation of x and y, where x and y are strings. Since λ represents the empty string, we do not write λ after it has been concatenated with another string. For example, cubsλ = cubs. It shouldn’t be hard to convince yourself that this definition describes any possible “word” in the given symbols. Refer to Example 3.15. Suppose that the symbols can be compared, so for any i and j with i ≠ j, either ai < aj or aj < ai. Modify the definition so that it defines the set of all strings whose symbols are in increasing order.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Example 3.15 Given a list of symbols a1, a2, …, am, a string of these symbols is:

B1. the empty string, denoted by λ, or

B2. any symbol ai, or

  R. xy, the concatenation of x and y, where x and y are strings.

Since λ represents the empty string, we do not write λ after it has been concatenated with another string. For example, cubsλ = cubs. It shouldn’t be hard to convince yourself that this definition describes any possible “word” in the given symbols.

Refer to Example 3.15. Suppose that the symbols can be compared, so for any i and j with i ≠ j, either ai < aj or aj < ai. Modify the definition so that it defines the set of all strings whose symbols are in increasing order.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Time complexity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education