On the public citation graph
Almost optimal bound of recurrent word length for regular automata
0 signed · 25 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/3-540-08860-1_25openalex-snapshot
Sur un cas particulier de la conjecture de Cerny
inferredcites →https://doi.org/10.1007/978-1-4612-1148-8openalex-snapshot
An Introduction to Convex Polytopes
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.1142/9789813270886_0005openalex-snapshot
Finite Dimensional Vector Spaces
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_31openalex-snapshot
Dynamics of the Independence Number and Automata Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_21openalex-snapshot
Synchronization of Some DFA
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_19openalex-snapshot
The Synchronization Problem for Strongly Transitive Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_19openalex-snapshot
The Synchronization Problem for Locally Strongly Transitive Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_13openalex-snapshot
On the Hybrid Černý-Road Coloring Problem and Hamiltonian Paths
inferred← citeshttps://doi.org/10.1007/s00236-009-0106-7openalex-snapshot
Strongly transitive automata and the Černý conjecture
inferred← citeshttps://doi.org/10.1007/s10559-022-00428-3openalex-snapshot
Cerny’s Conjecture for Automata with Simple Idempotents
inferred← citeshttps://doi.org/10.1007/s10559-024-00660-zopenalex-snapshot
Reset Thresholds of Transformation Monoids
inferred← citeshttps://doi.org/10.1007/s11390-008-9165-4openalex-snapshot
Some Aspects of Synchronization of DFA
inferred← citeshttps://doi.org/10.1016/j.aam.2012.07.003openalex-snapshot
Independent sets of words and the synchronization problem
inferred← citeshttps://doi.org/10.34229/kca2522-9664.24.2.3openalex-snapshot
RESET THRESHOLDS OF TRANSFORMATION MONOIDS
inferred← citeshttps://doi.org/10.46298/dmtcs.395openalex-snapshot
The \v Cerný conjecture for aperiodic automata
inferred← citeshttps://doi.org/10.48550/arxiv.1111.5467openalex-snapshot
Independent sets of words and the synchronization problem
inferred← citeshttps://doi.org/10.48550/arxiv.2105.09105openalex-snapshot
The Černy Conjecture for aperiodic automata
inferred← citeshttps://doi.org/10.48550/arxiv.2109.02743openalex-snapshot
Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents
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.