CSCI 4333 - Theory of Computation
Homework #4
P120, 3.19 Find a regular expression corresponding to the language accepted by the NFA pictured in
Figure 3.34. You should be able to do it without applying Kleenes theorem: First nd a regular expression
descr
3. For each language below, draw the FA which accepts that language over cfw_a, b
a. The language of all strings in which the number of as is even and the number of bs
is even
b. The language of all strings that do not end with ab
c. The language of all s
Christian Swan
Theory of Computation
HW#6
(A):
S aSb | B and B bB | .
(C):
S aSbb | .
Christian Swan
Theory of Computation
HW#6
Christian Swan
Theory of Computation
HW#6
Sep 3, 2013
Finite Automata
1. Operations: Union, Intersection and Difference
Operations
1. Formal definition
2. Process
a. Take the Cartesian product of the states.
b. Follow the transitions for all symbols from the start state.
c. Simplify graph by elim
Sep 12, 2013
1. Pumping Lemma
2. Building a machine using equivalence classes
3. Determining if two states represent L-distinguishable or L-indistinguishable sets
4. Minimizing the number of states in an FA
Pumping Lemma Review
1. Definition - If a langua
Sep 10, 2013
1. Can an FA be constructed with fewer states?
2. Pumping Lemma
Can an FA be constructed with fewer states? - Continued
1. Example pairwise L-Distinguishable strings map to states in the FA. If a pair of states
are not L-distinguishable, then
Sep 3, 2013
1. Equivalence Relations, Equivalence Classes
2. Can an FA be constructed with fewer states?
3. Pumping Lemma
Equivalence Relations
1. Equivalence relations are reflexive, symmetric and transitive
2. Equivalence class [x] set of all elements x
CSCI 4333 - Theory of Computation
Homework #1
Part 1 Logic Notation
1. Propositions p, q, r and s are defined as follows:
p is "I shall finish Theory Homework 1"
q is "I shall study for Theory for nine hours this week"
r is "I shall pass Theory"
s is "I l
CSCI 4333 - Theory of Computation
Homework #7 Key
1.
For the PDA in Table 5.6, trace the sequence of moves made for the input string bacab.
(q0, bacab, Z0)
/#2 (q0, acab, bZ0)
/#5 (q0, cab, abZ0)
/#8 (q1, ab, abZ0)
/#10 (q1, b, bZ0)
/#11 (q1, , Z0)
CSCI 4333 - Theory of Computation
Homework #3
P84, 2.36
For a certain language L cfw_a, b, IL has exactly four equivalence classes. They are [], [a], [ab], and [b].
It is also true that the three strings a, aa, and abb are all equivalent, and that the two
CSCI 4333 - Theory of Computation
Test 2 Review
Chapter 2
Finite Automata
o Definition/Notation (states, alphabet, start state, accepting states, transitions)
o Extended transition
L-distinguishable strings, L-indistinguishable strings
Constructing an FA
CSCI 4333 - Theory of Computation
Homework #1
Part 1 Logic Notation
1. Propositions p, q, r and s are defined as follows:
p is "I shall finish Theory Homework 1"
q is "I shall study for Theory for nine hours this week"
r is "I shall pass Theory"
s is "I l
Aug 13, 2013
Introduction to Theory of Computation
1. What is theory of computation?
2. What are the basics of Logic Notation?
3. What are some proof techniques?
Theory of Computation
1. What is a computer?
a. What kinds of problems can a computer solve?
Aug 15, 2013
More Logic, Proofs
1. Using Truth Tables to Prove Equivalence
2. Example: Proof by Construction The product of two odd integers is odd
3. Example: Proof by Cases -
Using Truth Tables to Prove Equivalence
In-Class Exercise 1.1, 1.4
Example: Pr
Christian Swan
Theory of Computation
HW#6
(A):
S aSb | B and B bB | .
(C):
S aSbb | .
Christian Swan
Theory of Computation
HW#6
Christian Swan
Theory of Computation
HW#6
Bismarck bb Germany 8 15 42000
Iowa bb USA 9 16 46000
North Carolina bb USA 9 16 37000
Yamato bb Japan 9 18 65000
/
/
/
/
/
Catherine Sanders
CSCI 284 HW 4
Due Feb. 22nd, 2009
List of queries to select specified items from HW list
http:/ldale.sewanee.edu/
Christian Swan
DBMS Assignment
HW#3
Christian Swan
DBMS Assignment
HW#3
(A): Give the class names and countries of the classes that carried guns of at least 16-inch bore.
Answer:
(class,country (bore 16 (Classes)
(B): Find the ships launched prior to 1921
CSCI2302 Data Structures and Algorithms
Assignment #4
An extra 3 days may be given to those who visit our CS tutor/instructor at least twice (2 times) to work
on this assignment a week before the due date written evidence is required.
Objective: Implement
Assume that the ready queue has just received 4 processes (P1, P2, P3, P4) in that that
order. The CPU cycles for these processes are: P1 - 14 ms, P2 - 10 ms, P3 - 5 ms, P4 - 2
ms. All arrive at time 0. Draw the Gantt chart and calculate the total wait/re
Aug 72, 2013
Languages, Structural Induction, Finite Automata
1. Languages
1. Languages
a. Definition set of strings over an alphabet
b. Examples
b.i. Toy palindromes, more as than bs, strings begin and end with b
b.ii. Real legal java identifiers, legal
Aug 20, 2013
Set Notation
1. Finite sets, infinite sets, empty sets
2. Operations
3. Set Identities
1. Finite sets, infinite sets, empty sets
a. Representation as a list of elements (possible ellipses)
b. Representation as a description
c. Only membership