Parikh’s Theorem is a fundamental result in automata theory with numerous applications in computer science. These include software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic protocols (e.g. using Horn clauses modulo equational theories) and database querying (e.g. evaluating path-queries in graph databases), among others. Parikh’s Theorem states that the … full description “Parikh’s Theorem for Symbolic Register Automata (available)”
Supervisor: Matteo Sammartino
Active: updated 5-MAR-2024 (OSAA035) no expiry
Self-localisation of drones using machine learning (available)
Drones are cool, but sometimes things go wrong. Imagine a drone is exploring an area, and all of a sudden the GPS signal becomes unreliable. How can the drone estimate its location, and avoid getting lost? Perhaps we can use data from its sensors and picture from the camera. In this project, we would like … full description “Self-localisation of drones using machine learning (available)”