Results 11 to 20 of about 59,128 (202)

Prefix–suffix duplication [PDF]

open access: yesJournal of Computer and System Sciences, 2014
We consider a bio-inspired formal operation on words called prefix-suffix duplication which consists in the duplication of a prefix or suffix of a given word. The class of languages defined by the iterated application of the prefix-suffix duplication to a word is considered.
García López de Lacalle, Jesús   +2 more
openaire   +5 more sources

Borders, palindrome prefixes, and square prefixes [PDF]

open access: yesInformation Processing Letters, 2021
We show that the number of length-n words over a k-letter alphabet having no even palindromic prefix is the same as the number of length-n unbordered words, by constructing an explicit bijection between the two sets. A slightly different but analogous result holds for those words having no odd palindromic prefix.
Daniel Gabric, Jeffrey O. Shallit
openaire   +3 more sources

On sequential composition, action prefixes and process prefix [PDF]

open access: yesFormal Aspects of Computing, 1994
Abstract We illustrate the difference between sequential composition in process algebra axiomatisations like ACP and action prefixing in process calculi like CCS. We define both early and late input in a general framework extending ACP, and consider various subalgebras, some very close to value passing CCS, another one close to CSP.
Baeten, J.C.M., Bergstra, J.A.
openaire   +6 more sources

Prefix probabilities for linear context-free rewriting systems [PDF]

open access: yes, 2012
We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and
Satta, Giorgio, Nederhof, Mark Jan
core   +2 more sources

maetshju/prefix-length-zipf:

open access: yes, 2022
Thoughts on the Zipfian relationship between the length of a prefix and the number of words sharing that ...
Matthew C. Kelley
core   +1 more source

yugt/sha256-prefix-collision: HPC search passed

open access: yes, 2023
<p>a.out successfully ran on HPC and find 70 pairs of prefix collisions of length 16 hexadecimal digits.
Guangting Yu
core   +1 more source

PREFIXES, SUFFIXES, AND INFIXESES IN KURMANJI (ZAZAKI) (Comparative descriptive study)

open access: yesگۆڤارا زانستێن مرۆڤایەتی یا زانكۆیا زاخۆ, 2017
This research "Prefixes, Suffixes, and Infixeses in Kurmanjki (Zazaki) is prepared on the basis of comparison to other dialects. The materials are taken from oral and written Kurmanjki resources.
Mehmet T. Malmîsanîj   +1 more
doaj   +1 more source

Verbe derivate cu în–1 (îm–1). Abordări logico-semantice în texte vechi românești [PDF]

open access: yesDiacronia, 2017
Lucrarea de față, înscrisă în cadrul morfologiei derivaționale, vizează analiza verbelor derivate cu în– (îm–), excerptate din texte vechi românești, din perspectivă logico-semantică.Pornind de la premisa că, indiferent de etapele unui idiom, există ...
Marinușa Constantin
doaj   +1 more source

A Corpus-based Study of the Productivity of Derivational Affixes in Persian [PDF]

open access: yesنشریه پژوهش‌های زبان‌شناسی, 2020
: One of the most important aspects of word-formation is considered as productivity which is a continuum concept in morphology (Bauer, 1996, and Baayen, 2009). Booij (2007) says that the frequent process in word formation is derivation.
Parvaneh Kohanzad   +2 more
doaj   +1 more source

On infinite prefix normal words

open access: yes, 2021
Prefix normal words are binary words with the property that no factor has more 1s than the prefix of the same length. Finite prefix normal words were introduced in Fici and Lipták (2011) [18].
Lipták, Zsuzsanna   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy