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
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 string
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
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 cont
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.
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 ov
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 string
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
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 dictio
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 fro
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.
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 ov
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
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 dictio