Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
(0, A, A, S, halt) (0, a, X, R, 1) (0, Y, Y, R, 3) accept A mark a with X no more a's (2, a, a, L, 2) Scan back left looking for X: X not found yet (2, Y, Y, L, 2) X not found yet (2, X, X, R, 0) X found, turn around Scan right looking for b to pair with a: (1, a, a, R, 1) b not found yet Scan right looking for A and halt: (1, Y, Y, R, 1) b not found yet (3, Y, Y, R, 3) (1, b, Y, L, 2) mark b with Y (3, A, A, S, halt) This TM does not accept the string aaabb. Why? Put your reason in the following box. You cannot simply say the number of a's is not the same as the number of b's. The TM cannot tell if the number of a's is not the same as the number of b's. It would reject a string only if it reaches a point that it cannot proceed any further and the state is not the ‘halt' state.

(0, A, A, S, halt) (0, a, X, R, 1) (0, Y, Y, R, 3) accept A mark a with X no more a's (2, a, a, L, 2) Scan back left looking for X: X not found yet (2, Y, Y, L, 2) X not found yet (2, X, X, R, 0) X found, turn around Scan right looking for b to pair with a: (1, a, a, R, 1) b not found yet Scan right looking for A and halt: (1, Y, Y, R, 1) b not found yet (3, Y, Y, R, 3) (1, b, Y, L, 2) mark b with Y (3, A, A, S, halt) This TM does not accept the string aaabb. Why? Put your reason in the following box. You cannot simply say the number of a's is not the same as the number of b's. The TM cannot tell if the number of a's is not the same as the number of b's. It would reject a string only if it reaches a point that it cannot proceed any further and the state is not the ‘halt' state.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
(0, A, A, S, halt) (0, a, X, R, 1) (0, Y, Y, R, 3) accept A mark a with X no more a's (2, a, a, L, 2) Scan back left looking for X: X not found yet (2, Y, Y, L, 2) X not found yet (2, X, X, R, 0) X found, turn around Scan right looking for b to pair with a: (1, a, a, R, 1) b not found yet Scan right looking for A and halt: (1, Y, Y, R, 1) b not found yet (3, Y, Y, R, 3) (1, b, Y, L, 2) mark b with Y (3, A, A, S, halt) This TM does not accept the string aaabb. Why? Put your reason in the following box. You cannot simply say the number of a's is not the same as the number of b's. The TM cannot tell if the number of a's is not the same as the number of b's. It would reject a string only if it reaches a point that it cannot proceed any further and the state is not the ‘halt' state.
Transcribed Image Text:(0, A, A, S, halt) (0, a, X, R, 1) (0, Y, Y, R, 3) accept A mark a with X no more a's (2, a, a, L, 2) Scan back left looking for X: X not found yet (2, Y, Y, L, 2) X not found yet (2, X, X, R, 0) X found, turn around Scan right looking for b to pair with a: (1, a, a, R, 1) b not found yet Scan right looking for A and halt: (1, Y, Y, R, 1) b not found yet (3, Y, Y, R, 3) (1, b, Y, L, 2) mark b with Y (3, A, A, S, halt) This TM does not accept the string aaabb. Why? Put your reason in the following box. You cannot simply say the number of a's is not the same as the number of b's. The TM cannot tell if the number of a's is not the same as the number of b's. It would reject a string only if it reaches a point that it cannot proceed any further and the state is not the ‘halt' state.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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
SEE MORE TEXTBOOKS