This paper studies the problem of predicting occurrences of a significant event in a discrete-event system. The predictability of occurrences of an event in a system is defined in the context of formal languages. The predictability of a language is a stronger condition than the diagnosability of the language. An implementable necessary and sufficient condition for predictability of occurrences ...

IN [1], in Figs. 1, 2, 3, and 4, all occurrences of “-” between words and all occurrences of a space between words are gone; as a result, some words are also not aligned with the boxes and some occurrences of “)” also do not appear in the right places. Corrections: Figs. 1, 2, 3, and 4 in [1] should have appeared as follows (the correct version of [1] is available from the author’s Web site: ht...

We study the generating function for the number of involutions on n letters containing exactly r 0 occurrences of 231. It is shown that finding this function for a given r amounts to a routine check of all involutions of length at most 2r + 2. © 2006 Elsevier B.V. All rights reserved.

Logic programs with positive occurrences of negation as failure have recently been introduced as a subset of the logic of minimal belief and negation as failure (MBNF). A unique feature of such programs, which other traditional logic programs lack, is that the minimality of answer sets does not hold. We reveal in this paper that this property is important for applying logic programming to repre...

ycadophyta presently consists of the living order Cycadales, which is comprised of three families worldwide. In the Mesozoic, cycads were represented by the Cycadales, plus another large order, Cycadeoidales (also referred to as Bennettitales). Cycadophyta is thought to have evolved from the Paleozoic seed ferns (pteridosperms), as did conifers, and eventually, angiosperms. However, Cycadales a...

We introduce the number of (k, i)-rounded occurrences of a part in a partition and use q-difference equations to interpret a certain q-series Sk,i(a;x; q) as the generating function for partitions with bounded (k, i)-rounded occurrences and attached parts. When a = 0 these partitions are the same as those studied by Bressoud in his extension of the Rogers-RamanujanGordon identities to even modu...

Counting the number of words which contain a set of given strings as substrings a certain number of times is a classical problem in combinatorics. This problem can, for example, be attacked using the transfer matrix method (see [20, Section 4.7]). In particular, it is a well-known fact that the generating function of such words is always rational. For example, in [20, Example 4.7.5] it is shown...

We address the problem of predicting events’ occurrences in partially observable timed systems modelled by timed automata. Our contribution is manyfold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event’s occurrence; 2) we show that 0-predictability is equivalent to the original notio...

We show a Θ(n log n) bound on the maximal number of occurrences of primitively-rooted k-th powers occurring in a string of length n for any integer k, k ≥ 2. We also show a Θ(n) bound on the maximal number of primitively-rooted powers with fractional exponent e, 1 < e < 2, occurring in a string of length n. This result holds obviously for their maximal number of occurrences. The first result co...

Emotion classification from text typically requires some degree of word-emotion association, either gathered from pre-existing emotion lexicons or calculated using some measure of semantic relatedness. Most emotion lexicons contain a fixed number of emotion categories and provide a rather limited coverage. Current measures of computing semantic relatedness, on the other hand, do not adapt well ...