Results 11 to 20 of about 10,035,291 (332)
A Complexity Theory for Feasible Closure Properties
Journal of computer and system sciences (Print), 1991 The study of the complexity of sets encompasses two complementary aims: (1) establishing-usually via explicit construction of algorithms-that sets are feasible, and (2) studying the relative complexity of sets that plausibly might be feasible but are not
Mitsunori Ogihara, Lane A. Hemaspaandra
semanticscholar +3 more sources
Closure Properties of Synchronized Relations. [PDF]
, 2019 A standard approach to define k-ary word relations over a finite alphabet A is through k-tape finite state automata that recognize regular languages L over {1, ..., k} x A, where (i,a) is interpreted as reading letter a from tape i. Accordingly, a word w in L denotes the tuple (u_1, ..., u_k) in (A^*)^k in which u_i is the projection of w onto i ...
Descotte, María Emilia +2 more
openaire +4 more sources
Nest sets and relativized closure properties
Theoretical Computer Science, 1983 AbstractA nest set is the language generated by a context-free grammar whose rules are A → aBāC or A → ϵ (where a, ā are paired terminal symbols, and A, B, C are nonterminal symbols). They can be seen as the one-dimensional expressions of the recognizable sets of binary trees. We study their closure properties under relativized operations with respect
Takahashi, Masako
openaire +3 more sources
Closure properties of Watson-Crick grammars [PDF]
, 2015 In this paper, we define Watson-Crick context-free grammars, as an extension of Watson-Crick regular grammars and Watson-Crick linear grammars with context-free grammar rules.
Nurul Liyana Mohamad Zulkufli +3 more
semanticscholar +3 more sources
Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties [PDF]
Logical Methods in Computer Science, 2023 Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity (AC) properties are proposed. The algorithms are based on a framework for computing a congruence
Deepak Kapur
doaj +1 more source
Internal Neighbourhood Structures II: Closure and closed morphisms [PDF]
Categories and General Algebraic Structures with Applications, 2023 Internal preneighbourhood spaces inside any finitely complete category with finite coproducts and proper factorisation structure were first introduced in \cite{2020}.
Partha Pratim Ghosh
doaj +1 more source
δω-Continuity and some Results on δω-Closure Operator
Journal of Mathematics, 2022 Al-Jarrah et al. defined a new topological operator, namely, δω-closure operator, and proved that it lies between the δ-closure operator and the usual closure operator. Al-Ghour et al. defined θω-closure operator and discussed its properties.
Manjeet Singh, Asha Gupta, Kushal Singh
doaj +1 more source
Properties of Discrete Reversed Aging Intensity Function [PDF]
Mathematics Interdisciplinary Research, 2022 In this paper, we discuss the properties of reversed aging intensity (RAI) function for discrete random variable and study its nature for some distributions. Further, using this function we characterize some discrete related distributions.
Faranak Goodarzi
doaj +1 more source
Closure Properties of Coalgebra Automata [PDF]
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2006 We generalize some of the central results in automata theory to the abstraction level of coalgebras. In particular, we show that for any standard, weak pullback preserving functor F, the class of recognizable languages of F -coalgebras is closed under taking unions, intersections and projections.
C.A. Kupke (Clemens), Y. Venema
openaire +3 more sources
Closure Fuzzy Filters of Decomposable MS-Algebras
Topological Algebra and its Applications, 2022 In this paper, we give some results of closure fuzzy filters of decomposable MS-algebras, characterization of closure fuzzy filters, and homomorphism of closure fuzzy filters.
Gubena Yeshiwas Mebrat +2 more
doaj +1 more source