We develop a new algorithm for determining if a given nondeterministic finite automaton is limited in nondeterminism. From this, we show that the numb...
In this paper we consider the problem of finding sets of long disjoint monotone subsequences of a sequence of n numbers. We give an algorithm that, af...
In this paper we shall describe a formal system which enables us to prove theorems within propositional calculus, logic of quantifiers and first order...
The traditional complement construction for LR(1) grammars is long and tedious and causes all of the structure of the original grammar to be lost. A n...
Action structures have previously been proposed as an algebra for both the syntax and the semantics of interactive computation. Here, a class of concr...
