896 search results - page 55 / 180 » On completeness of word reversing |
104
click to vote
ENTCS
2006
15 years 22 days ago
2006
In this paper, we describe a system, written in Haskell, for the automated verification of Web sites which can be used to specify (partial) correctness and completeness properties...
ENTCS
2006
15 years 22 days ago
2006
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
SIAMDM
2008
15 years 20 days ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
COMBINATORICS
2000
15 years 17 days ago
2000
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
JUCS
2002
15 years 12 days ago
2002
Abstract: We define rationally additive semirings that are a generalization of ()complete and (-)continuous semirings. We prove that every rationally additive semiring is an iterat...