The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Abstract-- This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus mo...
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...