The correspondence between a (96, 20, 4) symmetric design having regular automorphism group and a difference set with the same parameters has been used to obtain difference sets ...
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lo...
Nicholas Georgiou, Malgorzata Kuchta, Michal Moray...