FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...