Results 1 to 10 of about 13,214 (300)

Primitive sets of words [PDF]

open access: yesTheoretical Computer Science, 2021
Given a (finite or infinite) subset X of the free monoid A⁎ over a finite alphabet A, the rank of X is the minimal cardinality of a set F such that X⊆F⁎. We say that a submonoid M generated by k elements of A⁎ is k-maximal if there does not exist another
Castiglione G., Restivo A., Fici G.
core   +4 more sources

Primitive polynomials and word oriented linear feedback shift registers

open access: yesTongxin xuebao, 2009
Through a large number of experiments, an explicit formula was proposed for the number of primitive σ-LFSRs over finite field, which generalized a known formula for the number of primitive LFSRs over finite field, and also was the extension of the number
ZENG Guang   +3 more
doaj   +3 more sources

Defect Effect of Bi-infinite Words in the Two-element Case [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2001
Let X be a two-element set of words over a finite alphabet. If a bi-infinite word possesses two X-factorizations which are not shiftequivalent, then the primitive roots of the words in X are conjugates.
Ján Maňuch
doaj   +3 more sources

A Classification of Trapezoidal Words [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word
Gabriele Fici
doaj   +1 more source

Detecting Text Baselines in Historical Documents With Baseline Primitives

open access: yesIEEE Access, 2021
Previous deep learning based approaches to text baseline detection in historical documents usually take it as a semantic segmentation task. These methods adopt a fully convolutional neural network to predict baseline pixels first and then group them into
Wei Jia, Chixiang Ma, Lei Sun, Qiang Huo
doaj   +1 more source

Automatic detection of semantic primitives using optimization based on genetic algorithm [PDF]

open access: yesPeerJ Computer Science, 2023
In this article, we propose a method for the automatic retrieval of a set of semantic primitive words from an explanatory dictionary and a novel evaluation procedure for the obtained set of primitives.
Yevhen Kostiuk   +3 more
doaj   +2 more sources

گونه شناسی مفردات پژوهی در قرآن از منظر روایات تفسیری اهل بیت(ع) [PDF]

open access: yesپژوهش نامه معارف قرآنی, 2021
The study of the words of the Qur'an is one of the basic pillars of understanding the concepts and purposes of the Qur'an, which has been studied from different perspectives and dimensions and at different levels.
hashemi seyyed ghadir   +2 more
doaj   +1 more source

Tiling Periodicity [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2010
We contribute to combinatorics and algorithmics of words by introducing new types of periodicities in words. A tiling period of a word w is partial word u such that w can be decomposed into several disjoint parallel copies of u, e.g.
Juhani Karhumaki   +2 more
doaj   +1 more source

Investigating the Changes in the Term of Shiite with Historical Perspective [PDF]

open access: yesپژوهش‌نامه کلام تطبیقی شیعه, 2019
the thoughts of society in its developments, thus examining this word is lexically and terminologically analyzed and compared to synonymous terms in a more precise and comprehensive sense.
Ghasem Bostanee   +2 more
doaj   +1 more source

General Ramified Recurrence is Sound for Polynomial Time [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
Leivant's ramified recurrence is one of the earliest examples of an implicit characterization of the polytime functions as a subalgebra of the primitive recursive functions.
Ugo Dal Lago   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy