1. Move right. 2. Loop: 2.1. If the current symbol is x, change it to $ and move right. Otherwise exit loop. 2.2. Scan rightwards, past x's and #'s to find y. 2.3. If y found, change it to # and move right. Otherwise reject.

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
The following is a high level description for a luring machine M. List the first four elements of L(M) in
lexicographic order (shortest first, then alphabetically if same length).
1. Move right.
2. Loop:
2.1. If the current symbol is x, change it to $ and move right. Otherwise exit loop.
2.2. Scan rightwards, past x's and #'s to find y.
2.3. If y found, change it to # and move right. Otherwise reject.
2.4. Scan rightwards, past y's and %'s to find z.
2.5. If z found, change it to % and move left. Otherwise reject.
2.6. Scan leftwards, past x's, y's, #'s and %'s to find $.
2.7. When finding the first $, move right, and go back to 2.1.
3. If the current symbol is #, more right. Otherwise reject.
4. Scan rightwards, past #'s and %'s, to find the blank symbol.
5. When finding the first blank symbol, move right and accept.
€, xyz, xxyyzz, xxxyyyzzz
xyz, xxyyzz, xxxyyyzzz, xxxxyyyyzzzz
€, ZyX, ZZYYXX, ZZZYYYXXX
zYX, ZZYYXX, ZZZYYYXXX, ZZZZYYYYXXXX
Transcribed Image Text:The following is a high level description for a luring machine M. List the first four elements of L(M) in lexicographic order (shortest first, then alphabetically if same length). 1. Move right. 2. Loop: 2.1. If the current symbol is x, change it to $ and move right. Otherwise exit loop. 2.2. Scan rightwards, past x's and #'s to find y. 2.3. If y found, change it to # and move right. Otherwise reject. 2.4. Scan rightwards, past y's and %'s to find z. 2.5. If z found, change it to % and move left. Otherwise reject. 2.6. Scan leftwards, past x's, y's, #'s and %'s to find $. 2.7. When finding the first $, move right, and go back to 2.1. 3. If the current symbol is #, more right. Otherwise reject. 4. Scan rightwards, past #'s and %'s, to find the blank symbol. 5. When finding the first blank symbol, move right and accept. €, xyz, xxyyzz, xxxyyyzzz xyz, xxyyzz, xxxyyyzzz, xxxxyyyyzzzz €, ZyX, ZZYYXX, ZZZYYYXXX zYX, ZZYYXX, ZZZYYYXXX, ZZZZYYYYXXXX
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Types of Loop
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