We investigate the open problem to characterize whether infinite power of a given language is generated by an ω -code. In case code ( i.e. zero-relation language), was solved. this work, we solve for class one-relation languages.

A notion of open bisimulation is formulated for the spi calculus, an extension of the π-calculus with cryptographic primitives. This notion of open bisimulation is based on the so-called hedged bisimulation, due to Borgström and Nestmann. Open bisimulation is shown to be sound with respect to hedged bisimulation, and futher, open bisimilarity is shown to be a congruence relation on finite spi p...

We deal with the new class of pre-ℐ-regular pre-ℐ-open sets in which the notion of pre-ℐ-open set is involved. We characterize these sets and study some of their fundamental properties. We also present other notions called extremally pre-ℐ-disconnectedness, locally pre-ℐ-indiscreetness, and pre-ℐ-regular sets by utilizing the notion of pre-ℐ-open and pre-ℐ-closed sets by which we obtain some eq...

‎A topological space is called submaximal if each of its dense subsets is open and is called nodec if each of its nowhere dense ea subsets is closed‎. ‎Here‎, ‎we study a variety of spaces some of which have already been studied in $C(X)$‎. ‎Among them are‎, ‎most importantly‎, ‎quasi $P$-spaces and pointwise quasi $P$-spaces‎. ‎We obtain some new useful topological characterizations of quasi $...

Our goal in this paper is to investigate the effectiveness of relation extraction techniques for the slot-filling task. We discuss two relation extraction systems. YRES follows the traditional paradigm in relation extraction, where a system takes advantage of available examples for each relation to be extracted. On the other hand, SONEX follows the open relation extraction paradigm, where the r...

Discourse relation recognition is the task of identifying the semantic relationships between textual units. Conventional approaches to discourse relation recognition exploit surface information and syntactic information as machine learning features. However, the performance of these models is severely limited for implicit discourse relation recognition. In this paper, we propose an abductive th...