Alex Vassilio 26860039 Chapter 12 Critical Thinking
11/27/07
2. A. Yes, hackers who gain unapproved access should be punished because regardless of the premise under which they commit their crime they are still committing a crime and without author
CS Theory Section 3
Homework 5
Pages 87-88 #s 1, 2, 4b, c, d, 7, 10a, c
1.Use the construction in Theorem 3.1 to find an nfa that accepts the language L(
a b aa+bb a ab )
2.Find an nfa that accepts the complement of the language in Exercise 1.
4. Find dfa
Section 3
Homework 7
pgs 122-123, #s 3, 15 c, d,
3.Show that the language L=cfw_w :na (w)=nb (w) is not regular.
Proof:
Assume L is regular. Therefore, the Pumping Lemma holds true for L.
If you look at the string am b m , the length is greater than m, an
CS Theory Section 3
Homework 6
Pgs 96-97, #s 1, 2, 3, 6, 7
1.Construct a dfa that accepts the language generated by the grammar
S abA ; A baB ; B aAbb
Language:
aba bb
abba
a a (ab+ a )
2. Find a regular grammar that generates the language
L
S aSaA ; A a
CS Theory Section 3
Homework 3
pages 54-65, #s 2, 7, 12, 13, 17
2.Find a dfa that accepts the language defined by the nfa in figure 2.8.
JFLAP makes it difficult to see, but all of those have set notation, they are just blocked by the
circle.^
7.Design an
CS Theory Section 3
Homework 2
pg 27-30; #s 7, 11a, b, c, 16, 17, 21
_
_
7. Are there languages for which
L
?
L=
= cfw_
11. Find grammars for
cfw_a , b
that generates the sets of:
a. All strings with exactly one a
S bSSbbSba
b. All strings with at leas
a. False because 1=1 however CS does not equal cs because it is case sensitive. b. True because though 1 does not equal 0 3 equals 3 so the or makes it correct. c. False, because the negation makes 100 and !100 inequal d. False because 7 is not less
History of
the
Internet
and the
Web
Tim Berners-Lee
Online storage
(Internet)
Markup Languages
(HTML)
Hypertext (anchor
tags)
Structure
(HTML)
Presentation (CSS)
CSS for
Formatting
Why is it important to
use semantically clean
HTML?
Why do we use index
as
Web Design & Development
CSC 170
About You
1. Future web developers
Industry trends
Internships/Jobs
2. Technology majors
Best practices
Speed tips
3. Non-technology majors
Rapid web presence deployment
Foundations
Web Development Parts
Domain Name
Where is web development?
Marketing
Flexibility and Speed
Customer needs
Communication
Sales support
Web
Development
Front-End
Information
Presentation
HTML, CSS,
JavaScript
Back-End
Applications
PHP, ASP, SQL
Product Development
Product Life Cycl
CS Theory Section 3
Homework 4
Pgs 68-69 #s 1
pgs 75-76 #s1, 5, 7, 11, 16(a, b, d)
pg 68 # 1: Minimize the number of states in the figure 2.15:
pg 75 # 1: Find all strings in L = (a+b)* b (a +ab)*) of length less than four.
cfw_b, ab, bb, ba, bab, aba, bb
CS Theory Section 3
Homework 1
pgs 13-16, problems 2, 3, 7, 25, 27, extra
2. Show that if S1 and S2 are finite sets with |S1|=n and |S2|=m, then |S1 U S2| <= (n + m):
By the definition of a union, when you combine S1 and S2, it creates a new set that
cont