Foundations of Computer Science
Fall 2013
Rowan University
Homework 3 (Graded)
1. [ 20 points ] Translate each of these English sentences into a propositional calculus representation, using the dictionary below:
A: Merlyn is busy.
B: Merlyn has an apprent
Foundations of Computer Science
Fall 2012
Rowan University
Homework 8 (graded)
Construct a Context-Free Grammar for each of the following languages.
1. a*(bc)*(a + b + c)ab
2. cfw_ a n bc n | n > 0
3. cfw_ a n b m c n | n, m 0
Construct a Pushdown Automat
Foundations of Computer Science
Fall 2012
Rowan University
Homework 7 (graded)
1.
Design a Mealy machine with input alphabet cfw_a, b and output alphabet cfw_0, 1. After each input symbol is
read, the machine should output 0 if the input symbol was identi
Foundations of Computer Science
Fall 2012
Rowan University
Homework 6 (discussion)
1. Construct a Deterministic Finite Automaton (DFA) for each of the following languages:
a)
The set of all strings over cfw_a, b, c that end with bb and contain at least on
Foundations of Computer Science
Fall 2012
Rowan University
Homework 5 (graded)
1. Construct a Deterministic Finite Automaton (DFA) to describe each of the following languages:
a)
The set of all strings over cfw_a, b, c that begin with a b, end with an a,
Foundations of Computer Science
Fall 2012
Rowan University
Homework 4 (Discussion)
1. Translate each of these English sentences into a rst-order predicate calculus representation, using the dictionary
below. Use the Symbolic Logic Interpreter program at h
Foundations of Computer Science
Fall 2012
Rowan University
Homework 3 (Graded)
1. [ 20 points ] Translate each of these English sentences into a propositional calculus representation, using the dictionary below:
A: Merlyn is busy.
B: Merlyn has an apprent
Foundations of Computer Science
Fall 2013
Rowan University
Homework 9 (discussion) Revised Version
This is a revised version of the original homework 9. The changes are: Problem 1 has been changed from a Regular
Grammar to a Context-Free Grammar, and Prob
Foundations of Computer Science
Fall 2013
Rowan University
Homework 8 (graded)
Construct a Context-Free Grammar for each of the following languages.
1. a*(bc)*(a + b + c)ab
2. cfw_ a n bc n | n > 0
3. cfw_ a n b m c n | n, m 0
Construct a Pushdown Automat
Foundations of Computer Science
Fall 2013
Rowan University
Homework 7 (graded)
1.
Design a Mealy machine with input alphabet cfw_a, b and output alphabet cfw_0, 1. After each input symbol is
read, the machine should output 0 if the input symbol was identi
Foundations of Computer Science
Fall 2013
Rowan University
Homework 6 (discussion)
1. Construct a Deterministic Finite Automaton (DFA) for each of the following languages:
a)
The set of all strings over cfw_a, b, c that end with bb and contain at least on
Foundations of Computer Science
Fall 2013
Rowan University
Homework 5 (graded)
1. Construct a Deterministic Finite Automaton (DFA) to describe each of the following languages:
a)
The set of all strings over cfw_a, b, c that begin with a b, end with an a,
Foundations of Computer Science
Fall 2013
Rowan University
Homework 4 (Discussion)
1. Translate each of these English sentences into a rst-order predicate calculus representation, using the dictionary
below. Use the Symbolic Logic Interpreter program at h
Foundations of Computer Science
Fall 2012
Rowan University
Homework 9 (discussion)
1.
Design a Regular Grammar for the set of all strings over cfw_a, b, c that contain at least one "a" and do not contain any "c"s.
2.
Design a Deterministic Finite Automato