This document outlines a group assignment for a Theory of Computation course. It includes 3 parts: 1) Summarize a journal paper on elevator control using finite automata. 2) Identify a problem that could use a finite automata solution and describe the approach. 3) Draw a generalized non-deterministic finite automaton diagram and discuss three useful applications. The assignment is due as a hard copy on October 26th, 2023 and is worth 30 marks total.
This document outlines a group assignment for a Theory of Computation course. It includes 3 parts: 1) Summarize a journal paper on elevator control using finite automata. 2) Identify a problem that could use a finite automata solution and describe the approach. 3) Draw a generalized non-deterministic finite automaton diagram and discuss three useful applications. The assignment is due as a hard copy on October 26th, 2023 and is worth 30 marks total.
This document outlines a group assignment for a Theory of Computation course. It includes 3 parts: 1) Summarize a journal paper on elevator control using finite automata. 2) Identify a problem that could use a finite automata solution and describe the approach. 3) Draw a generalized non-deterministic finite automaton diagram and discuss three useful applications. The assignment is due as a hard copy on October 26th, 2023 and is worth 30 marks total.
COSC 340: THEORY OF COMPUTATION CAT 1 [30 MARKS] GROUP WORK DUE DATE: 26th October 2023 SUBMISSION MODE: HARD COPY (PRINTED) 1. Consider the attached journal paper on “Elevator Control System Using Finite Automata”. Read and discuss the paper as a group then write a summary of your findings.[10 Marks]
2. Brainstorm on a problem whose solution could be implemented using a Finite Automata.
Describe both the problem and the approach you would take to address the problem using Finite Automata. [10 Marks]
3. Draw a typical diagram of a Generalized Non Deterministic Finite Automaton. Formally
describe the machine. Highlight any three areas where GNFA are useful. [10 Marks]