MétaCan
Menu
Back to cohort
Record W1854120094 · doi:10.1142/s0129054111008131

PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS

2011· article· en· W1854120094 on OpenAlexafffund
Lila Kari, Benoît Masson, Shinnosuke Seki

Bibliographic record

VenueInternational Journal of Foundations of Computer Science · 2011
Typearticle
Languageen
FieldComputer Science
Topicsemigroups and automata theory
Canadian institutionsWestern University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCatenationMathematicsInvolution (esoterism)PalindromeWord (group theory)CombinatoricsCombinatorics on wordsCommutative propertyPrimitive root modulo nArithmeticDiscrete mathematicsModuloGeometry

Abstract

fetched live from OpenAlex

A pseudo-primitive word with respect to an antimorphic involution θ is a word which cannot be written as a catenation of occurrences of a strictly shorter word t and θ(t). Properties of pseudo-primitive words are investigated in this paper. These properties link pseudo-primitive words with essential notions in combinatorics on words such as primitive words, (pseudo)-palindromes, and (pseudo)-commutativity. Their applications include an improved solution to the extended Lyndon-Schützenberger equation u 1 u 2 ⋯ u ℓ = v 1 ⋯ v n w 1 ⋯ w m , where u 1 , … , u ℓ ∈ {u,θ(u)}, v 1 , …, v n ∈ {v, θ(v)}, and w 1 , … , w m ∈ {w, θ(w)} for some words u, v, w, integers ℓ, n, m ≥ 2, and an antimorphic involution θ. We prove that for ℓ ≥ 4, n, m ≥ 3, this equation implies that u, v, w can be expressed in terms of a common word t and its image θ(t). Moreover, several cases of this equation where ℓ = 3 are examined.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.662
Threshold uncertainty score0.395

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.031
GPT teacher head0.258
Teacher spread0.227 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations10
Published2011
Admission routes2
Has abstractyes

Explore more

Same venueInternational Journal of Foundations of Computer ScienceSame topicsemigroups and automata theoryFrench-language works237,207