MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Topic
semigroups and automata theory
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

1,153 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
1,153 works in the cohort · of 4,299,418page 5 of 24

Labels cover 1 of 1,153 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 1,153 of 1,153 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
BOUNDED PARIKH AUTOMATA
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Pattern expressions and pattern automata
Cezar Câmpeanu, Sheng Yü
2004· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
COMPLEXITY OF ATOMS OF REGULAR LANGUAGES
Janusz Brzozowski, Hellis Tamm
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
afffundno abstractunlabeled
Fixed points avoiding Abelian k-powers
James D. Currie, Narad Rampersad
2012· article· en· Journal of Combinatorial Theory Series A· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
A bijection between words and multisets of necklaces
Ira M. Gessel, Antonio Restivo, Christophe Reutenauer
2012· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Decimations of languages and state complexity
Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey Shallit
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Quasiperiodic and Lyndon episturmian words
Amy Glen, Florence Levé, Gwénaël Richomme
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
16
citations
afffundno abstractunlabeled
Transition complexity of language operations
Michael Domaratzki, Kai Salomaa
2007· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
16
citations
afffundno abstractunlabeled
Constructing divisions into power groups
Karl Auinger, Benjamin Steinberg
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
15
citations
affunlabeled
Operations on Unambiguous Finite Automata
Jozef Jirásek, Galina Jirásková, Juraj Šebej
2018· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affunlabeled
A PROFINITE APPROACH TO STABLE PAIRS
Karsten Henckell, John Rhodes, Benjamin Steinberg
2010· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
afffundno abstractunlabeled
Long binary patterns are Abelian 2-avoidable
James D. Currie, Terry I. Visentin
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Structural properties of Euclidean rhythms
Francisco Gómez, Perouz Taslakian, Godfried Toussaint
2009· article· en· Journal of Mathematics and Music· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
UNARY PATTERNS WITH INVOLUTION
Bastian Bischoff, James D. Currie, Dirk Nowotka
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
On the robustness of primitive words
Gheorghe Pǎun, Nicolae Sântean, G. Thierrin, Sheng Yü
2002· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Lyndon words and Fibonacci numbers
Kalle Saari
2013· article· en· Journal of Combinatorial Theory Series A· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Progressive solutions to a parallel automata equation
Khaled El‐Fakih, Nina Yevtushenko, Sergey Buffalov, Gregor von Bochmann
2006· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
On the existence of regular approximations
Brendan Cordy, Kai Salomaa
2007· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
13
citations

How this was built: Screen · Findings · About