Sciweavers

Share
13 search results - page 1 / 3
» mst 2011
Sort
View
MST
2011
206views Hardware» more  MST 2011»
8 years 7 months ago
Weighted Logics for Unranked Tree Automata
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
Manfred Droste, Heiko Vogler
MST
2011
237views Hardware» more  MST 2011»
8 years 7 months ago
On the Complexity of Computing Winning Strategies for Finite Poset Games
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
Michael Soltys, Craig Wilson
MST
2011
191views Hardware» more  MST 2011»
8 years 7 months ago
Vertex Cover Problem Parameterized Above and Below Tight Bounds
Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman ...
Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia...
MST
2011
182views Hardware» more  MST 2011»
8 years 7 months ago
Tilings and Submonoids of Metabelian Groups
Abstract. In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product Z ≀ (Z × Z). ...
Markus Lohrey, Benjamin Steinberg
books