Semantic Scholar uses AI to extract papers important to this topic.
Known to be decidable since 1981, there still remains a huge gap between the best known lower and upper bounds for the reach… Expand Abstract Recently, Haase, Ouaknine, and Worrell have shown that reachability in two-clock timed automata is log-space equivalent… Expand Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is… Expand We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in… Expand Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions… Expand Rush Hour is a children's game that consists of a grid board, several cars that are restricted to move either vertically or… Expand It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata ((nite tape Turing Machine (TM)). In… Expand Abstract Given an arbitrary position of the Othello game played on an n × n board, the problem of determining the winner is shown… Expand We give a PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial… Expand Abstract We consider automatic verification of finite state concurrent programs. The global state graph of such a program can be… Expand