Exam 1 - Part 1
1 of 7
file:/C:/CSC333/Exam 1 - Part 1.htm
You are logged in as (Log out)
CSC 333 (001) Spring 2016 Automata, Grammars, and Computability
My home CSC 333 (001) Spring 2016 Exams Exam 1
CSC 333 Homework Assignment 1
Out: January 24, 2017
Due: January 30, 2017
Unity ID: MISSING
Using the alphabet = cfw_0, 1, construct two deterministic finite automata.
Machine M 1 should accept every
CSC 333 Homework Assignment 2 Sample Solutions
Out: January 30, 2017
Due: February 6, 2017
Unity ID: jdoyle2
1. [25 points] Present both the automaton diagram and the full formal specification hQ, , ,
CSC 333 Homework Assignment 5 Sample Solutions
Out: February 22, 2017
Out: March 1, 2017
Unity ID: jdoyle2
This assignment constructs a regular expression that describes the language accepted by the D
CSC 333 Homework Assignment 5
Out: February 22, 2017
Out: March 1, 2017
Unity ID: MISSING
This assignment constructs a regular expression that describes the language accepted by the DFA M over the
alp
CSC 333 Homework Assignment 1 Sample Solutions
Out: January 24, 2017
Due: January 30, 2017
Unity ID: jdoyle2
Using the alphabet = cfw_0, 1, construct two deterministic finite automata.
Machine M 1 sh
CSC 333 Homework Assignment 7
Out: March 21, 2017
Due: March 29, 2017
Unity ID: MISSING
This assignment is to convert the context-free grammar G = hV, T, P, Si, where
V
=
cfw_S, A
T
=
cfw_0, 1
S
=
P
=
IS Decision using Clique Oracle
First, find the size of the maximum indepdent set using the following algorithm.
Algorithm 1: Max IS size
input : G = (V, E)
input : D - Clique oracle function
output:
CSC 333
Spring 2017
Automata, Grammars, and Computability
CSC 333 Spring 2017
Jon Doyle
Department of Computer Science
North Carolina State University
January 23, 2017
NC State University
1 / 368
Auto
CSC 333 Homework Assignment 3
Out: February 6, 2017
Out: February 13, 2017
Unity ID: MISSING
1. [25 points] Consider the eNFA M over = cfw_0, 1 with the state diagram
1
0
2
3
1
6
1
1
4
5
Give a table
CSC 333 Homework Assignment 4
Out: February 16, 2017
Out: February 22, 2017
Unity ID: MISSING
Let = cfw_0, 1, and consider the language
L = cfw_0n 1u0n | n 1, u
The following problems relate to showi
Part II CPU Scheduling (45 points)
True/False (10 points)
_F_ FCFS scheduling is preemptive scheduling.
_T _ Rate Monotonic Scheduling is a priority-scheduling algorithm.
_T _ Aging is a technique of
CSC 333 Homework Assignment 6 Sample Solutions
(corrected)
Out: March 13, 2017
Due: March 20, 2017
Unity ID: jdoyle2
This corrected set of sample solutions corrects three errors in the original versio
CSC 333 Homework Assignment 4 Sample Solutions
(Corrected)
Out: February 16, 2017
Out: February 22, 2017
Unity ID: jdoyle2
Let = cfw_0, 1, and consider the language
L = cfw_0n 1u0n | n 1, u
The follo
CSC 333 Homework Assignment 3 Sample Solutions
(Corrected)
Out: February 6, 2017
Out: February 13, 2017
Unity ID: jdoyle2
1. [25 points] Consider the eNFA M over = cfw_0, 1 with the state diagram
1
0
CSC 333 Homework Assignment 6
Out: March 13, 2017
Due: March 20, 2017
Unity ID: MISSING
Let L be the language over the alphabet cfw_x, y consisting of those strings in which there are exactly as many
CSC 333 Homework Assignment 2
Out: January 30, 2017
Due: February 6, 2017
Unity ID: MISSING
1. [25 points] Present both the automaton diagram and the full formal specification hQ, , , S, F i for a non
CSC 333
Spring 2017
Automata, Grammars, and Computability
CSC 333 Spring 2017
Jon Doyle
Department of Computer Science
North Carolina State University
January 23, 2017
NC State University
1 / 368
Auto
CSC 333, Spring 2017
Nonregular Languages
Identifying them with the Pumping Lemma
Jon Doyle
Instructor
Regular Languages Recognized by FA, L(M)
Definition: Language L(M) is regular if there is a finit
CSC 333, Fall 2016
Homework 2
page 1 of 2
Due Sunday, September 4 at 11:45 PM
Total points = 13
In all problems calling for design of a DFA, you must document, for each state q, the set L(q), i.e.,
th
CSC 333, Fall 2016
Homework 1
page 1 of 1
Due Sunday, August 28 at 11:45 PM
Total points = 36
Please submit homework solutions electronically using the WolfWare submit mechanism at
https:/courses.ncsu
CSC 333 Homework Assignment 10 Sample
Solution
Due 11/25/2013 before class
November 13, 2013
Please typeset your answers.
1. [40 points] Prove that the language L1 L2 , where L1 is recursively enumera
CSC 333 Homework Assignment 9 Sample
Solution
Due 11/8/13 before class
October 29, 2013
Please typeset your answers.
1. Construct a deciding TM for the language described by the regular expression (0
CSC 333 Homework Assignment 8 Sample
Solution (Corrected)
Due 10/30/2013 before class
October 17, 2013
Please typeset your answers.
1. [50 points] Construct a pushdown automaton for the language
L = c
CSC 333 Homework Assignment 7 Sample
Solution
Due 10/25/2013 before class
October 17, 2013
Please typeset your answers.
1. Let = cfw_0, 1. In this problem, we will prove that the language
L = cfw_0k 1
CSC 333 Homework Assignment 6 Sample
Solution
Due September 30, 2013 before class
September 20, 2013
Please begin the solution to each problem on a separate page. The
LaTeX command \newpage starts a n
CSC 333 Homework Assignment 4
Due 9/9/2013
August 30, 2013
Please begin the solution to each problem on a separate page.
The LaTeX command \newpage starts a new page.
Please typeset your answers.
1. P
CSC 333, Fall 2016
Homework 3
page 1 of 1
Due Sunday, September 11 at 11:45 PM
Total points = 14
In all problems calling for design of an automaton (DFA or NFA), you must document, for each
state q, t