CSE 5000 quiz 1
Turning machines were describes before electronic computers - ANS-true
this language (x000y: x,y in{0,1}*) container all strings, without exception, that contains 000 as a
substring - ANS-true
An NFA can recognize strings in a language that a DFA cannot recognize - ANS-false
The string 0101010101001101111 is accepted by this FA - ANS-False
The empty symbol always is a member of E* - ANS-true
Suppose we want to prove 'if H then C". If ones proves "not C then not H" is equivalent to
proving "if H then C" - ANS-true
What is the figure? start->A->0->B (0,1) - ANS-NFA
When you convert this NFA to a DFA how many accepting states will it have? start->A->1->B -
ANS-1
What is the cardinality of {0,1}* - ANS-infinity
The empty string always belongs to the alphabet E - ANS-false
A finite has a finite number of states - ANS-true
The string given as input to finite automata can be of infinite length - ANS-false
it is possible E* is the empty set - ANS-true
In a FA is a state cannot be reached from the start state we can normally ignore it - ANS-true
What is the cardinality of {e}? - ANS-1
When you covert the following to NFA to DFA how many reachable states will it have? Start->
A->1->B - ANS-3
An alphabet can have an infinite number of symbols - ANS-false
This is FA what language it accepts? start->A->1->B - ANS-1
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.
