Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to pure...
COMDES-II is a component-based software framework intended for Model Integrated Computing (MIC) of embedded control systems with hard real-time constraints. We present a transforma...
Xu Ke, Paul Pettersson, Krzysztof Sierszecki, Chri...
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...