1650 search results - page 118 / 330 » The HOM problem is decidable |
126
click to vote
FSTTCS
2003
Springer
15 years 9 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
118
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
129
Voted
ECAI
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
123
click to vote
FSTTCS
1993
Springer
15 years 8 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
136
Voted
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...