Automata theory Regular Cost Functions Contributions of the thesis

First Page		Document Content
Date: 2012-12-02 12:39:02 Mathematics Automata theory Models of computation Theory of computation Church–Turing thesis Finite-state machine Algorithm Decidability Krohn–Rhodes theory Theoretical computer science Computer science Computability theory		Automata theory Regular Cost Functions Contributions of the thesis Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Download Document from Source Website File Size: 672,42 KB Share Document on Facebook

	Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–60) DECIDABILITY IN LOCAL AND GLOBAL FIELDS Jochen Koenigsmann DocID: 1xVbU - View Document
	Decidability Results for Multi-objective Stochastic Games Romain Brenguier and Vojtˇech Forejt Department of Computer Science, University of Oxford, UK Abstract. We study stochastic two-player turn-based games in which DocID: 1xUOz - View Document
	On axiomatization and polytime decidability of strictly positive fragment of K4.3 M. Svyatlovsky Moscow Institute of Physics and Technology Wormshop 2017 DocID: 1vcjY - View Document
	On the Decidability Status of Reachability and Coverability in Graph Transformation Systems∗ Nathalie Bertrand1 , Giorgio Delzanno2 , Barbara König3 , Arnaud Sangnier4 , and Jan Stückrath3 1 2 DocID: 1v3xH - View Document
	Senior Thesis in Mathematics Infiniteness and Linear Temporal Logic: Soundness, Completeness, & Decidability DocID: 1v3pn - View Document