Home
Subjects
Create
Search
Log in
Sign up
Upgrade to remove ads
Only $2.99/month
Science
Computer Science
Computational Theory
CSE 355
STUDY
Flashcards
Learn
Write
Spell
Test
PLAY
Match
Gravity
Terms in this set (34)
If a finite automaton accepts no string, it recognizes only the empty string?
false
Let R be any regular expression. Then R concat with empty string = R?
true
GNFA's can recognize certain nonregular languages?
false
every DFA is also an NFA?
true
the union of two regular languages may or may not be regular?
false
empty set ^ star = empty set?
false
if a NFA has no states with self loops and no accept states with outgoing transitions, then its language is finite?
false
A DFA may have zero accept states?
true
an NFA may have zero or more states?
false
the pumping lemma is used to show languages are regular?
false
using the powerset construction method discussed in class to convert a 5 state NFA into an equivalent DFA, how many states would the DFA have before simplification?
32 because 2 ^5
which of the following languages over alphabet {0,1} is described by the regular expression: 1(0U1)
Σ (0U1)
*0?
strings that start with a 1, then contain at least a 1 or 0 before ending with a 0
which of the following describes the order of precedence for the regular operations?
star, concatenation, union
let L1 = {ε, aa, ab} over the alphabet {a, b}. which of the following strings is not in L1 concat L1?
(a) aaaa
(b)abab
(c) aaba
(d) abaa
(e) none of the above
(f) only c and d
(c) aaba
let L2 = empty set, L3 = {a,b}, L4 = ε over the alphabet {a,b}. Which of the following describes the languahe L3* concat L2 U L4?
(a) the empty set
(b) the empty string
(c) All strings over {a,b}
(d) none of the above
(b) the empty string
which of the following is true for GNFA's?
(a) transitions may have the empty set symbol
(b) there is only a single accept state
(c) the start state has only outgoing transitions
(d) the accept state has only incoming transitions
(e) all of the above
(f) only c and d
(f) only c and d
Let L5 = {www | w contains {0,1}*}, which of the following is true?
(a) L5 is nonregular becuase 0^p 10^p cannot be pumped
(b) L5 is nonregular because 0^p 10^p 10^p 1 cannot be pumped
(c) L5 is regular becuase the regular expression (ΣΣΣ)* describes the language
(d) L5 is regular because a finite automaton can be built to recognize it
(e) none of the above
(f) only c and d
(b) L5 is nonregular because 0^p 10^p 10^p 1 cannot be pumped
Let L6 = {1^n | n >= 0}, which of the following is true?
(a) L6 is nonregular because 1^p canot be pumped
(b) L6 is nonregular because 0^p cannot be pumped
(c) L6 is regular because the regular expression 1* describes the language
(d) L6 is regular because a finite automaton can be built to recognize it
(e) none of the above
(f) c and d
(f) c and d
An NFA is a PDA that doesnt use its stack?
true
Chomsky normal form is always unambiguous?
false
The context free languages are a subset of the regular languages?
false
in PDA's stacks provide unlimited memory using first in, first out?
false
The CFG S->S accepts only the empty language
true
The pumping lemma for context free languages is used to show languages are context free?
false
In PDA's multiple symbols can be pushed onto or popped off of the stack during a single transition?
false
DFAs have at least as many states as NFAs for a given language
false
NFAs are more powerful than DFAs
false
Every NFA can be converted to an equivalent DFA
true
The concatenation of two regular languages might not be regular
false
The intersection of a regular language and a context-free language might be regular
true
S → aS | bb | 𝜀 is a non-regular language
false
CFGs may sometimes be converted into NFAs
true
The union of a regular language and a context-free language is always a context-free language.
true
Recognizable languages are closed under complementation
false
This set is often in folders with...
CSE105
25 terms
303 Quiz 4
17 terms
Automata Re-Exam
47 terms
Automata Re-Exam, Finite Automata & Regular Expres…
84 terms
You might also like...
Py4e: Chapter 11
11 terms
Quiz5
30 terms
Computer science chapter 9@ and 9b homework
17 terms
Math 1022 Final
87 terms
Other sets by this creator
CSE 365 Midterm
51 terms
Geology 102 Exam 2
66 terms
Geology 101 Final Review
76 terms
Geology midterm exam
68 terms
Other Quizlet sets
PSYCH104 Review - Chapter 5 (Probability and Sampl…
20 terms
chap4rev
13 terms
CS 161 Midterm @ Winter 2020
20 terms
Psych 316 Exam 2 Review
11 terms