On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing

First Page		Document Content
Date: 2016-06-13 07:14:39 Computational complexity theory Finite automata Complexity classes Theory of computation Nondeterministic finite automaton Regular language PSPACE Bchi automaton FO Permutation IP Structure		On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing Add to Reading List Source URL: korrekt.org Download Document from Source Website File Size: 585,14 KB Share Document on Facebook

	Model Checking Probabilistic Knowledge: A PSPACE Case Xiaowei Huang and Marta Kwiatkowska University of Oxford, UK Abstract Model checking probabilistic knowledge of memoryful semantics is undecidable, even for a simple DocID: 1xVvn - View Document
	Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete Michael Blondin1, 2 Alain Finkel1 DocID: 1vlLP - View Document
	Subway Shuffle is PSPACE–complete (Preliminary draft) Marzio De Biasi∗ Tim Ophelders† DocID: 1viyb - View Document
	Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances Paul Bonsma∗ Institut f¨ ur Mathematik, Sekr. MA 6-1, Technische Universit¨at Berlin, DocID: 1uVHn - View Document
	Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete Michael Blondin∗†‡ , Alain Finkel†§ , Stefan G¨oller†¶k , Christoph Haase†§k and Pierre McKenzie∗†∗∗ ∗ DIRO DocID: 1uHDR - View Document