MétaCan
Menu
Back to cohort
Record W2973570009 · doi:10.1142/s0129054119400306

Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation

2019· article· en· W2973570009 on OpenAlexaff
Jozef Jirásek, Matúš Palmovský, Juraj Šebej

Bibliographic record

VenueInternational Journal of Foundations of Computer Science · 2019
Typearticle
Languageen
FieldComputer Science
Topicsemigroups and automata theory
Canadian institutionsUniversity of Saskatchewan
FundersVedecká Grantová Agentúra MŠVVaŠ SR a SAVAgentúra na Podporu Výskumu a Vývoja
KeywordsSuffixPrefixFactor (programming language)Regular languageStar (game theory)Computer scienceMathematicsComplementationDiscrete mathematicsLinguisticsArtificial intelligenceProgramming languageAutomaton

Abstract

fetched live from OpenAlex

We study Kuratowski algebras generated by prefix-, suffix-, factor-, and subword-free languages under the operations of star and complementation. We examine 12 possible algebras, and for each of them, we decide whether or not it can be generated by a prefix-, suffix-, factor-, or subword-free language. In each case when an algebra can be generated by such a language, we show that this language can be taken to be regular, and we compute upper bounds on the state complexities of all the generated languages. Finally, we find generators that maximize these complexities.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0020.002
Scholarly communication0.0020.004
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0050.001

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.012
GPT teacher head0.289
Teacher spread0.277 · 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 source (direct Gemma or distilled Codex), 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

Citations0
Published2019
Admission routes1
Has abstractyes

Explore more

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