Postdoctoral Research Associate in Reachability Problems £32,277 - £33,242 pa
Department of Computer Science, University of Liverpool
Closing date: Wed, 07 Oct 2015 17:00:00 BST
The post is available for 2 years.
Ref: R-589350/WWW
https://www.liv.ac.uk/working/jobvacancies/currentvacancies/research/r-589350/
***********************************************************************************************
A postdoctoral position in Reachability Problems is available at the University of Liverpool. You will work on an EPSRC-funded research project "Reachability Problems for Words, Matrices and Maps: Algorithms and Complexity", under the direction of Dr Igor Potapov. You will carry out research on decidability and complexity of reachability problems in various computational models including automata models, rewriting systems, matrix semigroups, iterative maps and hybrid systems. You should have a PhD (or be about to obtain) in Computer Science, Mathematics or closely related discipline together with relevant research expertise in theoretical computer science or in combinatorial, algorithmic and computational aspects of algebraic structures or dynamical systems. The post is available for 2 years.
Informal enquiries to Igor Potapov (potapov@liverpool.ac.uk)
For more information and application procedure visit
https://www.liv.ac.uk/working/jobvacancies/currentvacancies/research/r-589350/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
