affunlabeled
Bimachines and Structurally-Reversed AutomataNicolae Sântean
2004· article· en· Justus-Liebig-Universität Gießen· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
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.
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 10 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.
affno abstractunlabeled
Variants of codes and indecomposable languagesArto Salomaa, Kai Salomaa, Sheng Yü
2009· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGESAlexander Okhotin
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
The set of k-power free words over Σ is empty or perfectJames D. Currie, Robert O. Shelton
2003· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
The growth function of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>S</mml:mi></mml:math>-recognizable setsÉmilie Charlier, Narad Rampersad
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On a variant of the Ailon–Rudnick theorem in finite characteristicDragos Ghioca, Liang-chung Hsia, Thomas J. Tucker
2017· article· en· New York journal of mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound VariablesHoward Straubing, Denis Thérien
2001· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affunlabeled
State Complexity of Catenation Combined with Star and ReversalBo Cui, Yuan Gao, Lila Kari, Sheng Yü
2010· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
6
citations
affunlabeled
Automata Recognizing No Words: A Statistical ApproachCristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu
2006· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Order Structures for Subclasses of Generalised TracesRyszard Janicki, Jetty Kleijn, Maciej Koutny, Łukasz Mikulski
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affunlabeled
The graph structure of a deterministic automaton chosen at random2016· article· en· Random Structures and Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Journal of Automata, Languages and Combinatorics, Vol. 11(1)Siva Anantharaman, Gaétan Hains, Michaël Rusinowitch, Paul Gastin, John Mullins
2006· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
afffundno abstractunlabeled
Complexity of suffix-free regular languagesJanusz Brzozowski, Marek Szykuła
2017· article· en· Journal of Computer and System Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
Some new monoid and group constructions under semidirect products.Fırat Ateş
2009· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
State complexity of prefix distanceTimothy Ng, David Rappaport, Kai Salomaa
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
5
citations
afffundunlabeled
On ℤ-Modules of Algebraic IntegersJason P. Bell, Kevin G. Hare
2009· article· en· Canadian Journal of Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Width and size of regular resolution proofsAlasdair Urquhart
2012· article· en· Logical Methods in Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Representation and uniformization of algebraic transductionsStavros Konstantinidis, Nicolae Sântean, Sheng Yü
2006· article· en· Acta Informatica· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Alternating Finite Automata with Limited Universal BranchingChris Keeler, Kai Salomaa
2020· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
aboutno affunlabeled
Approximations de Séries Génératrices et Quelques ConjecturesSimon Plouffe
2014· preprint· fr· viXra· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
5
citations
afffundno abstractunlabeled
Palindromization and construction of Markoff triplesAntoine Abram, Mélodie Lapointe, Christophe Reutenauer
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Existential Length UniversalityPaweł Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey Shallit, Marek Szykuła
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
A note on abelian returns in rotation wordsNarad Rampersad, Michel Rigo, Pavel Salimov
2014· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Most Complex Regular Right-Ideal LanguagesJanusz Brzozowski, Gareth Davies
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affunlabeled
UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDSJason P. Bell
2005· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITEDLila Kari, Shinnosuke Seki
2011· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
A Hierarchy of Chains Embeddable into the Lexicographic Power $\boldsymbol{({\mathbb{R}}^\omega,\prec_{\rm lex})}$Alfio Giarlotta, Stephen Watson
2012· article· en· Order· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
Endomorphism monoids of generalized split graphs.Dancheng Lu, Tongsuo Wu
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
A Dynamical Proof of Pisot's TheoremJarosław Kwapisz
2006· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
5
citations
affno abstractunlabeled
A conjugacy criterion for pure <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>E</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math>-semigroupsRemus Floricel
2010· article· lv· Journal of Mathematical Analysis and Applications· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · none
5
citations
affno abstractunlabeled
Syntactic Complexity of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular LanguagesJanusz Brzozowski, Baiyu Li
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affunlabeled
Space Complexity of Stack Automata ModelsÓscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero
2021· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
Some combinatorial problems in the theory of partial transformation semigroupsAbdullahi Umar
2014· article· en· The scientific electronic library of periodicals of the National Academy of Sciences of Ukraine (National Academy of Sciences of Ukraine)· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
5
citations
affno abstractunlabeled
Star-Free Open Languages and Aperiodic LoopsMartin Beaudry, François Lemieux, Denis Thérien
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
5
citations
affno abstractunlabeled
State complexity of star of union and square of union on k regular languagesYuan Gao, Lila Kari
2013· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
5
citations
affno abstractunlabeled
Quasi-Distances and Weighted Finite AutomataTimothy Ng, David Rappaport, Kai Salomaa
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
Nonlinear Weighted Finite AutomataTianyu Li, Guillaume Rabusseau, Doina Precup
2018· article· en· International Conference on Artificial Intelligence and Statistics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
affno abstractunlabeled
Alternating and empty alternating auxiliary stack automataMarkus Holzer, Pierre McKenzie
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On the fractional parts of powers of Pisot numbers of length at most 4Artūras Dubickas, Jonas Jankauskas
2014· article· en· Journal of Number Theory· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
affunlabeled
Rational codes and free profinite monoidsJorge Almeida, Benjamin Steinberg
2009· article· en· Journal of the London Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Deciding the deterministic property for soliton graphsMiklós Bartha, Miklós Krész
2009· article· en· Ars Mathematica Contemporanea· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Enumeration of Decomposable Combinatorial Structures with Restricted PatternsDong Li, Zhicheng Gao, Daniel Panario
2009· article· en· Annals of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
State complexity of unique rational operationsNarad Rampersad, Nicolae Sântean, Jeffrey Shallit, Bala Ravikumar
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
5
citations
affno abstractunlabeled
Complexity of Proper Prefix-Convex Regular LanguagesJanusz Brzozowski, Corwin Sinnamon
2017· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
5
citations
affno abstractunlabeled
On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarietiesBenjamin Steinberg
2003· article· en· Journal of Pure and Applied Algebra· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
Independence algebras, basis algebras and semigroups of quotientsVictoria Gould
2010· article· en· Proceedings of the Edinburgh Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Multi-dimensional sets recognizable in all abstract numeration systemsÉmilie Charlier, Anne Lacroix, Narad Rampersad
2011· article· en· RAIRO - Theoretical Informatics and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Relativized codesMark Daley, Helmut Jürgensen, Lila Kari, Kalpana Mahalingam
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
5
citations
affno abstractunlabeled
The Intersection of Pseudovarieties of Central Simple SemigroupsEdmond W. H. Lee, Norman R. Reilly
2006· article· en· Semigroup Forum· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Results on Transforming NFA into DFCACezar Câmpeanu, Lila Kari, Andrei Păun
2004· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations