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
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
