On the public citation graph
A note on a recent attempt to improve the Pin-Frankl bound
0 signed · 20 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-88282-4_4openalex-snapshot
Synchronizing Automata and the Černý Conjecture
inferredcites →https://doi.org/10.1007/978-3-642-22953-4_15openalex-snapshot
Modifying the Upper Bound on the Length of Minimal Synchronizing Word
inferredcites →https://doi.org/10.1007/bf01071771openalex-snapshot
In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
inferredcites →https://doi.org/10.1016/j.automatica.2015.07.026openalex-snapshot
On primitivity of sets of matrices
inferredcites →https://doi.org/10.1016/s0195-6698(82)80025-5openalex-snapshot
An Extremal Problem for two Families of Sets
inferredcites →https://doi.org/10.1016/s0304-0208(08)73432-7openalex-snapshot
On two Combinatorial Problems Arising from Automata Theory
inferredcites →https://doi.org/10.1137/100816109openalex-snapshot
The Synchronizing Probability Function of an Automaton
inferredcites →https://doi.org/10.1137/15m1024603openalex-snapshot
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_27openalex-snapshot
On Completely Reachable Automata and Subset Reachability
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.12.043openalex-snapshot
A machine learning approach to synchronization of automata
inferred← citeshttps://doi.org/10.1016/j.ic.2016.06.013openalex-snapshot
Complexity of a problem concerning reset words for Eulerian binary automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.05.009openalex-snapshot
Complexity of road coloring with prescribed reset words
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.08.002openalex-snapshot
Preimage problems for deterministic finite automata
inferred← citeshttps://doi.org/10.1137/16m1094099openalex-snapshot
Primitive Sets of Nonnegative Matrices and Synchronizing Automata
inferred← citeshttps://doi.org/10.13140/rg.2.2.20208.66561openalex-snapshot
The length of a minimal synchronizing word and the Černy conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05455openalex-snapshot
Improving the upper bound on the length of the shortest reset words
inferred← citeshttps://doi.org/10.48550/arxiv.1805.02540openalex-snapshot
On Completely Reachable Automata and Subset Reachability
inferred← citeshttps://doi.org/10.48550/arxiv.2003.06177openalex-snapshot
Cerny-Starke conjecture from the sixties of XX century
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.