Results 11 to 20 of about 451,601 (187)
Defect Effect of Bi-infinite Words in the Two-element Case [PDF]
Discrete 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
Archaizing neologisms of Platon Lukashevich in the early works of Alexei Kruchenykh [PDF]
Rhema. Рема, 2021 The article discusses the genesis of Alexei Kruchenykh’s manner of writing. To achieve the goal, for the first time, a lexical comparison of the futurist poetic texts and Platon Lukashevich’s book “Charomutie, or sacred language of magicians, Magi and ...
I. Arzamastseva, N. Katanaev
doaj +1 more source
Automatic detection of semantic primitives using optimization based on genetic algorithm [PDF]
PeerJ 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
A Classification of Trapezoidal Words [PDF]
Electronic 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
A Note on the Primitive Roots and the Golomb Conjecture
Journal of Mathematics, 2021 In this paper, we use the elementary methods and the estimates for character sums to prove the following conclusion. Let p be a prime large enough.
Yiwei Hou, Hongyan Wang
doaj +1 more source
Word posets, with applications to Coxeter groups [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete.
Matthew J. Samuel
doaj +1 more source
On the decidability and complexity of Metric Temporal Logic over finite words [PDF]
Logical Methods in Computer Science, 2007 Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity.
Joel Ouaknine, James Worrell
doaj +1 more source
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reidenbach, Daniel +1 more
openaire +1 more source
Analysis of data types in "Comenius Logo"
Lietuvos Matematikos Rinkinys, 1999 This paper deals with two standpoint of data types in "Comenius Logo". The traditional one considers three kinds of "Comenius Logo" data structures: words, images, and lists. The modern standpoint pick out three mechanisms of forming and exploring data:
Valentina Dagienė
doaj +3 more sources
Spinal Metastases of Supratentorial Glioblastoma with Primitive Neuronal Component
World Neurosurgery: X, 2019 Background: Glioblastoma multiforme with a primitive neuronal component is a rare entity, with few cases reported in the literature. Case Description: A patient who had a supratentorial glioblastoma multiforme with a primitive neuronal component ...
Kathrin Vollmer +4 more
doaj +1 more source