MétaCan
Menu
Back to cohort
Record W2394623614

Descriptional Complexity of Block-Synchronization Context-Free Grammars.

2002· article· en· W2394623614 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueDCFS · 2002
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicDNA and Biological Computing
Canadian institutionsWestern University
Fundersnot available
KeywordsContext-sensitive grammarTree-adjoining grammarSymbol (formal)Indexed grammarContext-free grammarAbstract family of languagesSynchronization (alternating current)Computer scienceL-attributed grammarContext (archaeology)Rule-based machine translationBlock (permutation group theory)MathematicsTheoretical computer scienceProgramming languageNatural language processingCombinatoricsSecond-generation programming languageTopology (electrical circuits)
DOInot available

Abstract

fetched live from OpenAlex

We consider the descriptional complexity of block-synchronization context-free grammars, BSCF grammars. In particular, we consider the number of necessary situation and begin symbols as complexity measures. For weak and strong derivations, one begin symbol and two situation symbols are sufficient to generate all respective language families. Surprisingly, one situation symbol with equality synchronization is also sufficient to generate all weak derivation BSCF languages. The family of synchronized context-free languages (SCF languages) generated by grammars with one situation symbol using equality synchronization gives a language family properly between that of E0L and ET0L languages. Some normal forms are also presented for all variations. In addition, we show that either prefix or equality synchronization can be used to describe all weak and strong derivation languages.

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.

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.000
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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.420
Threshold uncertainty score0.248

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.053
GPT teacher head0.234
Teacher spread0.181 · 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