Exercise on Franks, Chapter One.
Your group should submit a ONE set of five answers. Each answer should be a paragraph or two at the
most and written in your own words. How you organize and divide the labor will be up to your group.
However, above the ans
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Deterministic Finite Automaton
(Part 2)
Lecture 06
Day 06/31
CS 154
Formal Languages and Computability
Fall 2016
Ahmad Yazdankh
CS 154
Formal Languages and Computability
Spring 2016
Department of Computer Science
San Jose State University
Instructor: Ron Mak
Assignment #2
Assigned:
Due:
Thursday, February 11
Wednesday, February 17 at 11:59 pm
Individual assignment, 100 points max
CS 154
Formal Languages and Computability
Spring 2016
Department of Computer Science
San Jose State University
Instructor: Ron Mak
Assignment #1
Assigned:
Due:
Tuesday, February 2
Monday, February 8 at 11:59 pm
Individual assignment, 100 points max
Introd
CS154
HW7
Due date: 04/29/2016
1.
Union:
Assume L1 and L2 are recursively enumerable. We have two unrestricted grammars
G1 and G2, such that
L(G1) = L1 and L(G2) = L2.
G1 = (V1, 1, P1, S1)
G2 = (V2, 2, P2, S2)
We can assume without less of generality that
CS154_HW#5
03/23/2016
Use the pumping lemma for context-free languages to prove that each of the following
languages is not context-free.
1 L1 = cfw_anb2nan: n >= 0
Let string w = ambmbmam which is in L1.
The substring vxy can lie anywhere in w.
Ex:
| a m
HW#3
Notice: below m, n, k, j, i, p, q are integers.
1. Use the pumping lemma to show that the language L = cfw_an : n is a perfect
cube: 0, 1, 8, 27, is not regular.
Proof:
Assume L is regular, and so the pumping lemma must be true for L. Let
w = xyz =
CS154
Assignment#1
Ex.1: Strings b and abb are in the language, while bb, abba,
babb and baa are not in the language.
Ex.2:
we know the G = (cfw_S, cfw_a, b, S, P) with P of S-> aSb|SS|ab
then S aSb aaSbbaabb, and Sab
so s * abaabb , therefore, the langua
CS 154
Formal Languages and Computability
February 4 Class Meeting
Department of Computer Science
San Jose State University
Spring 2016
Instructor: Ron Mak
www.cs.sjsu.edu/~mak
Did We Understand
The proof that |uv| = |u| + |v| ?
The fact that L* = L* ?
C
CS 154
Formal Languages and Computability
February 2 Class Meeting
Department of Computer Science
San Jose State University
Spring 2016
Instructor: Ron Mak
www.cs.sjsu.edu/~mak
Basic Info
Office hours
TuTh 4:30 5:30 PM
MH 413
Class website
http:/www.cs.sj
CS 154
Formal Languages and Computability
February 11 Class Meeting
Department of Computer Science
San Jose State University
Spring 2016
Instructor: Ron Mak
www.cs.sjsu.edu/~mak
Corrected DFA Example #1
1
Starts and ends
with 0
po
p1
1
0
0
0
S
1
0
1
qo
St
CS 154
Formal Languages and Computability
February 9 Class Meeting
Department of Computer Science
San Jose State University
Spring 2016
Instructor: Ron Mak
www.cs.sjsu.edu/~mak
Review: Automata
An automaton is an abstract model
of a digital computer.
An a
CS 154
Formal Languages and Computability
March 8 Class Meeting
Department of Computer Science
San Jose State University
Spring 2016
Instructor: Ron Mak
www.cs.sjsu.edu/~mak
BNF for Simple Expressions
<expression> := <simple expression>
<simple expression
CS 154
Formal Languages and Computability
February 25 Class Meeting
Department of Computer Science
San Jose State University
Spring 2016
Instructor: Ron Mak
www.cs.sjsu.edu/~mak
The Pumping Lemma for Regular Languages
Discovered by Yehoshua Bar-Hillel,
Mi
CS 154
Formal Languages and Computability
April 19 Class Meeting
Department of Computer Science
San Jose State University
Spring 2016
Instructor: Ron Mak
www.cs.sjsu.edu/~mak
Unofficial Field Trip
Computer History Museum in Mt. View
http:/www.computerhist
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Deterministic Finite Automaton
(Part 3)
Lecture 07
Day 07/31
CS 154
Formal Languages and Computability
Fall 2016
Ahmad Yazdankh
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Formal Languages
(Part 2)
Lecture 04
Day 04/31
CS 154
Formal Languages and Computability
Fall 2016
Ahmad Yazdankhah | CS 154: F
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Formal Languages
(Part 1)
Lecture 04
Day 04/31
CS 154
Formal Languages and Computability
Fall 2017
Ahmad Yazdankhah | CS 154: F
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Mathematical Preliminaries
(Part 1)
Lecture 02
Day 02/31
CS 154
Formal Languages and Computability
Fall 2017
Ahmad Yazdankhah |
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Mathematical Preliminaries
(Part 2)
Lecture 03
Day 03/31
CS 154
Formal Languages and Computability
Fall 2017
Ahmad Yazdankhah |
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Formal Languages
(Part 3)
Lecture 06 - 1
Day 06/31
CS 154
Formal Languages and Computability
Fall 2017
Ahmad Yazdankhah | CS 15
San Jos State University
College of Social Science
Interdisciplinary Social Science and Sociology Department
AAS 33A, Asian Americans and U.S. History and Political Institutions
Fall Semester, 2017
Instructors
Joel Franks (section 6)Yvonne Kwan (Section 7
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Formal Languages
(Part 2)
Lecture 05
Day 05/31
CS 154
Formal Languages and Computability
Fall 2017
Ahmad Yazdankhah | CS 154: F
Appointment Notification sent by AppointmentPlus
5:25 PM (1
hour ago)
<[email protected]>
to me
long,
Thank you for making an appointment with us. You are confirmed for the following
appointment:
Tuesday, September 26, 2017
Service: Computer Sc
Class
CS147, Sec 01
Homework I
Due Date
Sep 25, 2017 11:59 PM PST
Instructions
1. There are 8 questions with total 10 points.
2. Please create electronic document with your answer.
3. There is no need to include the question itself. However, you MUST
incl
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Formal Languages
(Part 3)
Lecture 05-1
Day 05/31
CS 154
Formal Languages and Computability
Fall 2016
Ahmad Yazdankhah | CS 154:
San Jos State University
Department of Computer Science
Ahmad Yazdankhah
[email protected]
www.cs.sjsu.edu/~yazdankhah
Nondeterministic Finite Automaton
(Part 2)
Lecture 09
Day 09/31
CS 154
Formal Languages and Computability
Fall 2016
Ahmad Yazda
Homework #5
Spring 2016
CS 154: Formal Languages and Computability
San Jos State University
Assigned: Friday, March 04
Section: _
Department of Computer Science
Name: _
Prof.: Ahmad Yazdankhah
[email protected]
List #: _
Given = cfw_a, b, convert
Homework #6
Spring 2016
CS 154: Formal Languages and Computability
San Jos State University
Assigned: Friday, March 11
Section: _
Department of Computer Science
Name: _
Prof.: Ahmad Yazdankhah
[email protected]
List #: _
1. Prove L = cfw_anbk : n
San Jos State University
Prof.: Ahmad Yazdankhah
Department of Computer Science
[email protected]
Spring 2016
CS 154: Formal Languages and Computability
Assigned: 04/24/2016
Assignment #7 Requirements
(Version 1.00)
Objective
To construct a standa
Homework #2
Spring 2016
CS 154: Formal Languages and Computability
San Jos State University
Assigned: Friday, Feb 05
Section: _
Department of Computer Science
Name: _
Prof.: Ahmad Yazdankhah
[email protected]
List #: _
1. Considering A B = A B ide
Homework #3
Spring 2016
CS 154: Formal Languages and Computability
San Jos State University
Assigned: Friday, Feb 12
Section: _
Department of Computer Science
Name: _
Prof.: Ahmad Yazdankhah
[email protected]
List #: _
1. For = cfw_a, b, construct