Requirements
For this practice assessment, you are required to give a presentation via slide show of the analysis of a computational problem. This analysis has to be performed using one of the models and methods shown during lectures. The problem has to be identified within your main area of expertise and approved by Dr Mario Gianni. The collection of slides you will present has to expose the following contents,
Problem identification:
Describe the problem in your own area of expertise highlighting where it is possible to apply one of the computational models chosen among:
- Regular expressions and automata
- Finite-state transducers
- Context-free grammars
- Turing machines
- Problem relevance:
Describe the motivations for which it is important to provide a solution to the problem and what are the main benefits for an application in your domain of expertise.
Problem statement:
Describe a rigorous formulation of the problem.
- State-of-the-art:
Provide a brief background literature review of the problem as well as of the proposed solutions.
Implementation:
Explain the computational model that has been chosen.
Provide the solution to the problem based on the above computational model.
- Complexity Analysis:
- Provide an analysis of the complexity of the problem as well as of the proposed solution.
- Conclusion:
- Discuss advantages, disadvantages and main limitations of the methods used to address the problem under consideration.
References:
The bibliography used in the slides. Harvard style of referencing is preferred.