523 search results - page 49 / 105 » Decidability of string graphs |
117
click to vote
VMCAI
2009
Springer
15 years 10 months ago
2009
Springer
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability r...
109
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
101
Voted
FMCAD
2000
Springer
15 years 7 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
136
click to vote
FSTTCS
2000
Springer
15 years 7 months ago
2000
Springer
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
123
click to vote
IANDC
2008
15 years 3 months ago
2008
We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecules may be assembled by using onl...