First Page | Document Content | |
---|---|---|
Date: 2018-05-21 09:45:07Complexity classes Mathematics Theoretical computer science Discrete mathematics EXPTIME P Reachability problem Matrix Controllability Decidability Reachability Word problem | Reachability games and related matrix and word problems Thesis submitted in accordance with the requirements of the University of Liverpool for the degree of Doctor in Philosophy byAdd to Reading ListSource URL: cgi.csc.liv.ac.ukDownload Document from Source WebsiteFile Size: 4,10 MBShare Document on Facebook |