Results 21 to 30 of about 3,681 (231)
Lexicographic Unranking of Combinations Revisited
Algorithms, 2021 In the context of combinatorial sampling, the so-called “unranking method” can be seen as a link between a total order over the objects and an effective way to construct an object of given rank.
Antoine Genitrini, Martin Pépin
doaj +1 more source
On morphisms preserving infinite Lyndon words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words.
Gwenael Richomme
doaj +1 more source
Научный диалог, 2022 The problem of lexicographic fixation of neologisms at the present stage of development of German-language lexicography by private explanatory dictionaries of electronic format is considered.
E. A. Smolonogina, I. O. Sitnikova
doaj +1 more source
Superposition for Lambda-Free Higher-Order Logic [PDF]
Logical Methods in Computer Science, 2021 We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables.
Alexander Bentkamp +3 more
doaj +1 more source
Fuzzy-Relation-Based Lexicographic Minimum Solution to the P2P Network System
IEEE Access, 2020 In the existing work in the literature, the addition-min fuzzy relation inequalities was applied to describe a peer-to-peer (P2P) network system. In such a model, the total download traffic of a terminal was considered.
Yanbo Ma, Xiaobin Yang, Bing-Yuan Cao
doaj +1 more source
Representing Small Ordinals by Finite Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than omega^omega. We design a polynomial time algorithm that constructs, for each well-ordered regular language L with respect to ...
Zoltan Ésik
doaj +1 more source
Lexikos, 2021 South African English can be regarded as a fully-fledged variety of English which qualifies for comprehensive lexicographic treatment. This paper focuses on the presentation and treatment of South African English in A Dictionary of South African English ...
Rufus H. Gouws
doaj +1 more source
Lexicographic Constrained Multicriteria Ordered Clustering [PDF]
, 2021 Researchers in the multicriteria analysis community have recently started to study the application of clustering techniques. Different methods have been proposed leading to complete or partial multicriteria partitions. Recently, a method based on the exploitation of the ordinal properties of a valued preference relation has been developed in order to ...
Rosenfeld, Jean +2 more
openaire +1 more source
ON MATCHING EXTENDABILITY OF LEXICOGRAPHIC PRODUCTS [PDF]
, 2017 A graph G of even order is l-extendable if it is of order at least 2l + 2, contains a matching of size l, and if every such matching is contained in a perfect matching of G.
Dibek, Cemil +4 more
core +2 more sources
On the Order Type of Scattered Context-Free Orderings [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than ω^2, then its order type is effectively computable.
Kitti Gelle, Szabolcs Iván
doaj +1 more source