This document provides instructions for an assignment involving theory of computation concepts. Students are asked to: 1) Convert the regular expression "aa(a+b)*bb(a+b)" into a non-deterministic finite automaton (NFA) using a JFLAP simulator. 2) Find the regular expression for a given NFA. 3) Convert the grammar rules "S → aXbX", "X → aY | bY | ∈", "Y→X|c" into Chomsky normal form.
This document provides instructions for an assignment involving theory of computation concepts. Students are asked to: 1) Convert the regular expression "aa(a+b)*bb(a+b)" into a non-deterministic finite automaton (NFA) using a JFLAP simulator. 2) Find the regular expression for a given NFA. 3) Convert the grammar rules "S → aXbX", "X → aY | bY | ∈", "Y→X|c" into Chomsky normal form.
This document provides instructions for an assignment involving theory of computation concepts. Students are asked to: 1) Convert the regular expression "aa(a+b)*bb(a+b)" into a non-deterministic finite automaton (NFA) using a JFLAP simulator. 2) Find the regular expression for a given NFA. 3) Convert the grammar rules "S → aXbX", "X → aY | bY | ∈", "Y→X|c" into Chomsky normal form.