CSCI 383 Fall 2011
LaTeX Resource
General Information
LaTeX is a document markup language that will help you produce beautiful mathematical solutions. It allows you to produce professional-looking pdf or dvi documents with relative ease. Its
used by scien
A Hands-on Approach to FLA with
JFLAP
JFLAP and Regular Languages
Susan Rodger, Duke University
Thomas Finley, Cornell University
Peter Linz, University of California, Davis
SIGCSE 2006
March 4, 2006
Finite Automata Editing
and Simulation
The most basic f
A Hands-on Approach to FLA with
JFLAP
JFLAP in the Classroom
Susan Rodger, Duke University
Thomas Finley, Cornell University
Peter Linz, University of California, Davis
SIGCSE 2006
March 4, 2006
JFLAP in CPS 140 at Duke
Lecture
Demo how to use JFLAP
So
A Hands-on Approach to FLA with
JFLAP
JFLAP with CFL
Susan Rodger, Duke University
Thomas Finley, Cornell University
Peter Linz, University of California, Davis
SIGCSE 2006
March 4, 2006
JFLAP Context-free Languages
Create
Nondeterministic PDA
Context-
A Hands-on Approach to FLA with
JFLAP
Recursively Enumerable Languages
Susan Rodger, Duke University
Thomas Finley, Cornell University
Peter Linz, University of California, Davis
SIGCSE 2006
March 4, 2006
JFLAP Recursively
Enumerable Languages
Create
Tur
A Hands-on Approach to FLA with
JFLAP
SLR(1) Parsing
Susan Rodger, Duke University
Thomas Finley, Cornell University
Peter Linz, University of California, Davis
SIGCSE 2006
March 4, 2006
Parsing in JFLAP
Brute Force Parsing
Reg. Grammars, CFG, unrestric
A Hands-on Approach to Formal
Languages and Automata with
JFLAP
Susan Rodger, Duke University
Thomas Finley, Cornell University
Peter Linz, University of California, Davis
SIGCSE 2006
March 4, 2006
Who We Are.
Susan Rodger
Duke University
Associate Prof
CSCI 383 Fall 2007
Schedule Attempt #2
Here is an updated tentative schedule up to Dec. 3. More updates to follow!
Date
Sept 5
7
Sept 10
11
12
14
Sept 24
26
27
28
Oct 1
Oct 1
3
4?
5
Oct 15
16?
17
Oct 19
Oct 29
31
Nov. 2
Nov. 5
7
9
Nov 12
14
16
Nov 19
Nov
CSCI 383 Fall 2007
LaTeX Resource
General Information
LaTeX is a document markup language that will help you produce beautiful mathematical solutions. It allows you to produce professional-looking pdf or dvi documents with relative ease. Its
used by scien
CSCI 383 Fall 2007
Proof Technique: Construction
Main Steps
The 3 main steps of a proof by construction are as follows:
Step 1: State your claim. State the specic type of object you claim exists.
Step 2: Construct the object. Given any set of valid parame
CSCI 383 Fall 2007
Schedule Attempt #3
Here is an updated tentative schedule up to Dec. 3. More updates to follow!
Date
Sept 5
7
Sept 10
11
12
14
Sept 24
26
27
28
Oct 1
Oct 1
3
4
5
Oct 15
17
19
Oct 29
Oct 31
Nov. 2
Nov. 5
Nov. 7
8
9
Nov 12
14
16
Nov 19
No
CSCI 383 Fall 2007
Schedule Attempt #1
The following is a tentative schedule up to Thanksgiving. Ill try to stick to it as much as possible,
but I suspect it is a leeeetle ambitious.
Date
Sept 5
7
Sept 10
12
14
Sept 17
19
21
Sept 24
26
28
Oct 1
3
5
Oct. 8
CSCI 383 Fall 2007
Proof Technique: Contradiction
Main Steps
The 4 main steps of a proof by contradiction are as follows:
Step 1: State your goal. State what property P you are trying to prove.
Step 2: Assume the contrary. Assume that P is not true, by wa
CSCI 383 Fall 2007
Proof Technique: Induction
Main Steps
The 5 main steps for an induction proof are as follows:
Step 1: State your P (n). State your P (n), which should be a property as a function of n. Also
state for which n you will prove your P (n) to
CS 341 (Algorithms)
Pseudocode
In the text and lectures, algorithms will often be expressed in pseudocode, a mixture of code
and English (for specic not necessarily good examples of particular pseudocodes, see p. 17 of
the course text, or the examples in
CSCI 383 Fall 2007
Proof Technique: Games with Demons
Main Steps
The 4 main steps for proving a language A is not regular is as follows:
Step 1: Demon Picks k 0. You are given some pumping length k 1.
Step 2: You pick xyz. Select x, y, z such that xyz A a
A Hands-on Approach to FLA with
JFLAP
History of JFLAP
Susan Rodger, Duke University
Thomas Finley, Cornell University
Peter Linz, University of California, Davis
SIGCSE 2006
March 4, 2006
How did JFLAP get Started?
Aug. 1989 Rodger started teaching
auto
A Hands-on Approach to FLA with
JFLAP
Wrap Up
Susan Rodger, Duke University
Thomas Finley, Cornell University
Peter Linz, University of California, Davis
SIGCSE 2006
March 4, 2006
Wrap-up
Fitting JFLAP into a Course
What Students think of JFLAP
JFLAPs usa
A Hands-on Approach to FLA with
JFLAP
L-Systems
Susan Rodger, Duke University
Thomas Finley, Cornell University
Peter Linz, University of California, Davis
SIGCSE 2006
March 4, 2006
L-Systems
Model biological systems
and create fractals
Similar to Choms
CSCI 383 Fall 2011
Proof that a Language is Context-Free
Main Steps
The main steps for proving a language A is context-free is as follows:
Step 1: Dene a context-free grammar. Dene a 4-tuple G = (N, , P, S) that represents
your context-free grammar.
Step
CSCI 383 Fall 2011
Notes on Homeworks
Here are a few comments about the homework assignments in CS 383.
Generally the assignments will be challenging. It is often helpful to look at the problems
early; even if you dont spend a lot of time on them right a
CSCI 383 Fall 2011
Proof by Structural Induction
Structural induction is used to prove a property P of all the elements of some recursively-dened
data type. The following are some examples of recursively dened data types:
Example 1: An even number e is ei
CSCI 383 Fall 2011
Proof by Induction
Main Steps
Please follow these 4 steps when doing a proof by induction.
Step 1: State your P (n). State what property of n you are trying to prove, which should be a
property as a function of n. Also state for which n
CSCI 383 Fall 2011
Proof by Games with Demons
Main Steps
The 4 main steps for proving a language A is not regular is as follows:
Step 1: Demon Picks k 1. You are given some pumping length k 1.
Step 2: You pick xyz. Select x, y, z such that xyz A and |y| k
CSCI 383 Fall 2011
Proof that a Function of Regular Languages is Regular
Suppose you are asked to prove a statement such as the following:
Show that if A is regular, then f (A) is also regular, for some function f .
Show that if A and B are regular, then
CSCI 383 Fall 2009
Proof by Games with Demons
Main Steps
The 4 main steps for proving a language A is not regular is as follows:
Step 1: Demon Picks k 1. You are given some pumping length k 1.
Step 2: You pick xyz. Select x, y, z such that xyz A and |y| k
CSCI 383 Fall 2009
LaTeX Resource
General Information
LaTeX is a document markup language that will help you produce beautiful mathematical solutions. It allows you to produce professional-looking pdf or dvi documents with relative ease. Its
used by scien
Vol 440|27 April 2006
NEWS & VIEWS
LANGUAGE
Startling starlings
Gary F. Marcus
Man the tool-maker. Man the cultural animal.
Man the mimic. Its tempting to summarize
the differences between humans and other
species in a concise phrase, but most posited
dif
CSCI 383 Fall 2009
Proof that a Language is Context-Free
Main Steps
The main steps for proving a language A is context-free is as follows:
Step 1: Dene a context-free grammar. Dene a 4-tuple G = (N, , P, S) that represents
your context-free grammar.
Step
SCIgen - An Automatic CS Paper Generator
About Generate Examples Talks Code Donations Related People Blog
About
SCIgen is a program that generates random Computer Science research papers, including graphs,
figures, and citations. It uses a hand-written co