Exam (elaborations)
CSE 355 Quiz 8 Questions with 100% Actual correct
CSE 355 Quiz 8 Questions with 100% Actual correct
[Show more]
Content preview
CSE 355 Quiz 8Suppose a PDA pops, but doesn't push, on every transition. Then the
language of the PDA is context-free, but not necessarily regular. - ANS-False
Suppose a PDA pushes, but doesn't pop, on every transition. Then the
language of the PDA is context-free, but not necessarily regular - ANS-False
Suppose a PDA pushes or pops, but doesn't do both or neither, on every transition. Then the
language of the PDA is context-free, but not necessarily regular. - ANS-True
In the formal definition of a PDA, we cannot swap the order of push and pop in the transition
function; we must allow popping before pushing, instead of pushing before popping. - ANS-True
Context-free languages are closed under intersection with regular languages - ANS-True
Suppose I have an algorithm to test if a given CFG accepts some input. Therefore, I also have
an algorithm to test if a given PDA accepts some input. - ANS-True
My friend believes that we can convert a DFA into an equivalent PDA as follows: everything
remains the same as the DFA except for every transition labelled a in
the DFA, we augment the transition to be a, (epsilon) → (epsilon) between the same pair of
states. Is his idea correct?
(a) His idea is correct because DFAs and PDAs recognize the same class of languages.
(b) His idea is correct because DFAs are just PDAs that ignore its stack.
(c) His idea is not correct because this introduces empty transitions, which were not present in
the DFA.
(d) His idea is not correct because there are some languages that a DFA can recognize that a
PDA cannot.
(e) None of the above. - ANS-b
In the conversion of a PDA with n states to a CFG, the number of variables created (without
doing any simplifications) is:
(a) Constant independent of n.
(b) O(n^2) but not a constant independent of n.
(c) O(n^3) but not O(n^2).
(d) Not O(n^3).
(e) Impossible to classify without more information. - ANS-b
In the conversion of a PDA with n states to a CFG, the number of rules created (without doing
any simplifications) is:
(a) Constant independent of n.
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Hkane. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for £6.57. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
72042 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy revision notes and other study material for 14 years now