共计 8828 个字符，预计需要花费 23 分钟才能阅读完成。
HW1 : Regular Expressions and Deterministic Finite
Automata
CSE105Sp22
Due: : 4/7/22 at 5pm (no penalty late submission until 8am next morning), via
Gradescope
In this assignment,
You will practice reading and applying the definitions of alphabets, strings, languages, Kleene
star, and regular expressions. You will use regular expressions and relate them to languages and
automata. You will use precise notation to formally define the state diagram of DFA, and you
will use clear English to describe computations of DFA informally.
Resources: To review the topics you are working with for this assignment, see the class material
from Week 1. We will post frequently asked questions and our answers to them in a pinned Piazza
post.
Reading and extra practice problems: Sipser Section 0, 1.3, 1.1. Chapter 1 exercises 1.1,
1.2, 1.3, 1.18, 1.23.
For all HW assignments:
Weekly homework may be done individually or in groups of up to 3 students. You may switch HW
partners for different HW assignments. The lowest HW score will not be included in your overall
HW average. Please ensure your name(s) and PID(s) are clearly visible on the first page of your
homework submission and then upload the PDF to Gradescope. If working in a group, submit
only one submission per group: one partner uploads the submission through their Gradescope
account and then adds the other group member(s) to the Gradescope submission by selecting
their name(s) in the”Add Group Members”dialog box. You will need to re-add your group
member(s) every time you resubmit a new version of your assignment. Each homework question
will be graded either for correctness (including clear and precise explanations and justifications of
all answers) or fair effort completeness. You may only collaborate on HW with CSE 105 students
in your group; if your group has questions about a HW problem, you may ask in drop-in help
hours or post a private post (visible only to the Instructors) on Piazza.
Copyright Mia Minnes, 2022, Version March 31, 2022 (1)
All submitted homework for this class must be typed. You can use a word processing editor if
you like (Microsoft Word, Open Office, Notepad, Vim, Google Docs, etc.) but you might find
it useful to take this opportunity to learn LaTeX. LaTeX is a markup language used widely in
computer science and mathematics. The homework assignments are typed using LaTeX and you
can use the source files as templates for typesetting your solutions. To generate state diagrams of
machines, we recommend using Flap.js or JFLAP. Photographs of clearly hand-drawn diagrams
may also be used. We recommend that you submit early drafts to Gradescope so that in case of
any technical difficulties, at least some of your work is present. You may update your submission
as many times as you’d like up to the deadline.
Integrity reminders
Problems should be solved together, not divided up between the partners. The homework
is designed to give you practice with the main concepts and techniques of the course, while
getting to know and learn from your classmates.
You may not collaborate on homework with anyone other than your group members. You
may ask questions about the homework in office hours (of the instructor, TAs, and/or
tutors) and on Piazza (as private notes viewable only to the Instructors). You cannot
use any online resources about the course content other than the class material from this
quarter – this is primarily to ensure that we all use consistent notation and definitions we
will use this quarter and also to protect the learning experience you will have when the
‘aha’moments of solving the problem authentically happen.
Do not share written solutions or partial solutions for homework with other students in
the class who are not in your group. Doing so would dilute their learning experience and
detract from their success in the class.
You will submit this assignment via Gradescope (https://www.gradescope.com) in the assign-
ment called“HW1CSE105Sp22”.
Assigned questions
- (Graded for correctness1) For L a set of strings over the alphabet {0, 1}, we can define the
following associated sets
LZ(L) = {0kw | w ∈ L, k ∈ Z, k ≥ 0}
TZ(L) = {w0k | w ∈ L, k ∈ Z, k ≥ 0}
1This means your solution will be evaluated not only on the correctness of your answers, but on your ability
to present your ideas clearly and logically. You should explain how you arrived at your conclusions, using
mathematically sound reasoning. Whether you use formal proof techniques or write a more informal argument
for why something is true, your answers should always be well-supported. Your goal should be to convince the
reader that your results and methods are sound.
Copyright Mia Minnes, 2022, Version March 31, 2022 (2)
Note: the commas in the set-builder definition indicate“and”.
Note: 0k is the result of concatenating 0 with itself k times; it is the string of k 0s.
Note: Formally, LZ and TZ are each functions, with domain the set of languages over
{0, 1} and with codomain the set of languages over {0, 1}.
(a) Specify an example language L1 over {0, 1} where LZ(L1) = Σ?, or explain why
there is no such example. A complete solution will include either (1) a precise and
clear description of your example language L1 and a precise and clear description of
the result of computing LZ(L1) using the definitions to justify this description and
justifying the set equality with Σ?, or (2) a sufficiently general and correct argument
why there is no such example, referring back to the relevant definitions.
(b) Specify an example language L2 over {0, 1} where LZ(L2) is a finite set, or explain
why there is no such example. A complete solution will include either (1) a precise
and clear description of your example language L2 and a precise and clear description
of the result of computing LZ(L2) using the definitions to justify this description and
justifying why it is finite, or (2) a sufficiently general and correct argument why there
is no such example, referring back to the relevant definitions.
(c) Specify an example language L3 over {0, 1} where LZ(L3) = TZ(L3), or explain why
there is no such example. A complete solution will include either (1) a precise and
clear description of your example language L3 and a precise and clear description
of the results of computing LZ(L3) and TZ(L3) using the definitions to justify this
description and justifying the set equality, or (2) a sufficiently general and correct
argument why there is no such example, referring back to the relevant definitions. - (Graded for correctness) Consider the two regular expressions over Σ = {0, 1}
R1 = ((000 ∪ 111)? ∪ (01)? ) R2 = ((000)?(111)?(ε ∪ 0 ∪ 1))
You will prove that
L(R1) 6? L(R2) and L(R2) 6? L(R1) and L(R1) ∩ L(R2) 6= ? and L(R1) ∪ L(R2) 6= Σ?
by giving four example strings that witness these properties.
(a) Specify an example string w1 such that w1 ∈ L(R1) ∩ L(R2). Briefly justify your
choice, referring to the definitions of the regular expressions and their semantics.
(b) Specify an example string w2 such that w2 ∈ L(R1) ∩ L(R2). Briefly justify your
choice, referring to the definitions of the regular expressions and their semantics.
(c) Specify an example string w3 such that w3 ∈ L(R1) ∩ L(R2). Briefly justify your
choice, referring to the definitions of the regular expressions and their semantics.
(d) Specify an example string w4 such that w4 ∈ L(R1) ∩ L(R2). Briefly justify your
choice, referring to the definitions of the regular expressions and their semantics.
Copyright Mia Minnes, 2022, Version March 31, 2022 (3) - (Graded for fair effort completeness2)
(a) Pick a four letter alphabet (a nonempty finite set), and specify it, e.g. by filling in the
blank Σ = fill in your alphabet here.
Then, pick a language of cardinality (size) 2 over this alphabet, and specify it, e.g. by
filling in the blank
L = fill in your language here
Note: we encourage you to pay attention to syntax here. There are many correct
answers; please be precise in how you present the sets you choose.
(b) Give a regular expression that describes the language L you defined in part (a). Briefly
justify why your regular expression works.
(c) Give a DFA that recognizes your language L you defined in part (a). Specify your
DFA both using a formal definition and a state diagram. Briefly justify why your
DFA works. - (Graded for correctness) Consider the DFA C given by the state diagram below.
State diagram for DFA C
Suppose someone tells you that the formal definition of this DFA is
(Q,Σ, δ, q0, F) = ({q0, q1, q2, q3, q4, q5}, {0, 1, 2}, δ, q0, q0)
where δ : Q× Σ→ Q is given by
δ((q, 0)) =
?????
q5 if q = q0
qj if q = qi and i ∈ {1, 2, 3} and j = i+ 1
q if q ∈ {q4, q5}
δ((q, 1)) =
q1 if q = q0
q5 if q ∈ {q1, q4, q5}
δ((q, 0)) if q = q2 or q = q3
2This means you will get full credit so long as your submission demonstrates honest effort to answer the
question. You will not be penalized for incorrect answers. To demonstrate your honest effort in answering the
question, we ask that you include your attempt to answer each part of the question. If you get stuck with your
attempt, you can still demonstrate your effort by explaining where you got stuck and what you did to try to get
unstuck.
Copyright Mia Minnes, 2022, Version March 31, 2022 (4)
(a) Confirm that this formal description is correct (in that it is consistent with the state
diagram), or fix any and all mistakes in it. In your solution, explicitly address whether
the description of the set of states is correct, whether the description of the alphabet
is correct, whether the description of the transition function is correct, whether the
description of the start state is correct, and whether the description of the accept
states is correct, and why.
(b) Modify the set of accept states of this state diagram to get a different DFA (with the
same set of states, alphabet, start state, and transition function) that recognizes an
infinite language. Your solution should include the diagram of this new DFA and an
explanation of why the language it recognizes is infinite. - (Graded for fair effort completeness) Which of the following are valid descriptions using
the terminology we have used in class and in the book so far? For those that aren’t, explain
what’s wrong. For those that are, give an example of what’s being described.
(a) A finite automaton accepts a regular expression.
(b) The language described by a regular expression is a finite automaton.
(c) The empty string is the language of some regular expression.
(d) A string of length one uses one symbol from the alphabet.
(e) The input string runs a finite automaton.
Copyright Mia Minnes, 2022, Version March 31, 2022 (5)
