******************************************************************* Postdoctoral Research Associate in Reachability Problems £32,277 - £33,242 pa
Department of Computer Science, University of Liverpool Closing date: Monday, 05 Jan 2015 17:00:00 GMT The post is available for 2 years. Ref: R-586930/WWW http://www.liv.ac.uk/working/jobvacancies/currentvacancies/research/r-586930/ ******************************************************************* A postdoctoral position in Reachability Problems is available at the University of Liverpool. You will work on the new EPSRC-funded research project "Reachability problems for words, matrices and maps: Algorithms and Complexity” http://gow.epsrc.ac.uk/NGBOViewGrant.aspx?GrantRef=EP/M00077X/1 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 in Computer Science, Mathematics or a closely related area 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 ([email protected]) For more information and application procedure visit http://www.liv.ac.uk/working/jobvacancies/currentvacancies/research/r-586930/ ---- [[ Petri Nets World: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]] [[ Mailing list FAQ: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]] [[ Post messages/summary of replies: ]] [[ [email protected] ]]
