Abstract. We investigate the structure of the set of gapped motifs (repeated patterns with don’t cares) of a given string of symbols. A natural equivalence classification is int...
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalen...
Gem Stapleton, John Howse, John Taylor, Simon J. T...
A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1, . . . , k − 1} under cyclic rotation. In this paper we define an ordering on t...
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...