Consider the following pushdown automata : M1: Q = {q0, q1, q2}, ∑ = {a, b, c}, Γ = {X}, q0 = q0, F = {q2}, δ: δ(q0, a, λ) = {[q0, X]}; δ(q0, b, X) = {[q1, λ]}; δ(q1, b, X) = {[q1, λ]}; δ(q1, c, λ) = {[q2, λ]}; δ(q2, c, λ) = {[q2, λ]}. What is the shortest string accepted by this automaton, M1? A.abc B.ab C.c D.Empty string (λ or ε)
Consider the following pushdown automata : M1: Q = {q0, q1, q2}, ∑ = {a, b, c}, Γ = {X}, q0 = q0, F = {q2}, δ: δ(q0, a, λ) = {[q0, X]}; δ(q0, b, X) = {[q1, λ]}; δ(q1, b, X) = {[q1, λ]}; δ(q1, c, λ) = {[q2, λ]}; δ(q2, c, λ) = {[q2, λ]}. What is the shortest string accepted by this automaton, M1? A.abc B.ab C.c D.Empty string (λ or ε)
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
Related questions
Question
Consider the following pushdown automata :
M1: Q = {q0, q1, q2}, ∑ = {a, b, c}, Γ = {X}, q0 = q0, F = {q2},
δ: δ(q0, a, λ) = {[q0, X]};
δ(q0, b, X) = {[q1, λ]};
δ(q1, b, X) = {[q1, λ]};
δ(q1, c, λ) = {[q2, λ]};
δ(q2, c, λ) = {[q2, λ]}.
What is the shortest string accepted by this automaton, M1?
M1: Q = {q0, q1, q2}, ∑ = {a, b, c}, Γ = {X}, q0 = q0, F = {q2},
δ: δ(q0, a, λ) = {[q0, X]};
δ(q0, b, X) = {[q1, λ]};
δ(q1, b, X) = {[q1, λ]};
δ(q1, c, λ) = {[q2, λ]};
δ(q2, c, λ) = {[q2, λ]}.
What is the shortest string accepted by this automaton, M1?
A.abc
B.ab
C.c
D.Empty string (λ or ε)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education