# Automata, Computability and Complexity Theory Group

Current research projects involving members of the group include:

- Reachability problems for words, matrices and maps: Algorithms and Complexity EPSRC

I Potapov (2014-2018) - Energy Efficient Control, EPSRC

S Schewe, D Wojtczak (2015-2019) - iTract: Islands of Tractability in Ontology-Based Data Access, EPSRC

F Wolter, A Hernich, B Konev (2015-2018)

Completed projects include:

- Reachability problems in integer sequences defined by linear recurrences (Vaisala Foundation - Finnish Science Academy)

V Halava (2014-2015) - London Mathematical Society International Short Visit Grant

I Potapov (2015) - Reachability in context of Robot Games. Nokia Foundation Scholarship

R Niskanen (2014) - 19th International Symposium on Fundamentals of Computation Theory, London Mathematical Society Conference Grant

I Potapov (2013) - Synthesis and Verification in Markov Game Structures, EPSRC

S Schewe, D Wojtczak, AT Shenton (2010-2013) - Specification and Verification of Infinite-State Systems: Focus on Data, Royal Society International Joint Project

I Potapov (2011-2013) - Trust metrics for SPKI/SDSI, EPSRC

D Wojtczak (2010-2012) - Synthesising Permissive Monitors, Royal Society

S Schewe (2010-2011) - European Symposium on Algorithms, London Mathematical Society Conference Grant

I Potapov (2010)

## About the Automata, Computability and Complexity Theory Group

Staff and students |

Our research interests |