On the public citation graph
The Cerný conjecture for automata respecting intervals of a directed graph
0 signed · 35 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/11821069_68openalex-snapshot
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
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/3-540-44683-4_38openalex-snapshot
Synchronizing Finite Automata on Eulerian Digraphs
inferredcites →https://doi.org/10.1007/3-540-45007-6_8openalex-snapshot
Synchronizing Monotonic Automata
inferredcites →https://doi.org/10.1007/978-3-540-88282-4_4openalex-snapshot
Synchronizing Automata and the Černý Conjecture
inferredcites →https://doi.org/10.1016/j.tcs.2004.03.068openalex-snapshot
Synchronizing monotonic automata
inferredcites →https://doi.org/10.1016/j.tcs.2004.09.006openalex-snapshot
Synchronizing generalized monotonic automata
inferredcites →https://doi.org/10.1016/j.tcs.2009.03.021openalex-snapshot
Synchronizing automata preserving a chain of partial orders
inferredcites →https://doi.org/10.1016/j.tcs.2011.06.012openalex-snapshot
The Černý conjecture for one-cluster automata with prime length cycle
inferredcites →https://doi.org/10.1016/s0304-3975(02)00405-xopenalex-snapshot
Synchronizing finite automata on Eulerian digraphs
inferredcites →https://doi.org/10.1051/ita/1998321-300211openalex-snapshot
Sur les automates circulaires et la conjecture de Černý
inferredcites →https://doi.org/10.1090/s0002-9947-08-04712-0openalex-snapshot
Representation theory of finite semigroups, semigroup radicals and formal language theory
inferredcites →https://doi.org/10.1137/0219033openalex-snapshot
Reset Sequences for Monotonic Automata
inferredcites →https://doi.org/10.46298/dmtcs.395openalex-snapshot
The \v Cerný conjecture for aperiodic 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-22360-5_23openalex-snapshot
Checking Whether an Automaton Is Monotonic Is NP-complete
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_13openalex-snapshot
On the Interplay Between Babai and Černý’s Conjectures
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_19openalex-snapshot
Strong Inapproximability of the Shortest Reset Word
inferred← citeshttps://doi.org/10.1007/s10801-018-0851-1openalex-snapshot
A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
inferred← citeshttps://doi.org/10.1016/j.aam.2018.04.006openalex-snapshot
Strongly connected synchronizing automata and the language of minimal reset words
inferred← citeshttps://doi.org/10.1016/j.dam.2020.04.029openalex-snapshot
Synchronizing sequences for road colored digraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2016.09.021openalex-snapshot
Černý conjecture for edge-colored digraphs with few junctions
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.1142/s0129054116500167openalex-snapshot
Subset Synchronization and Careful Synchronization of Binary Finite Automata
inferred← citeshttps://doi.org/10.46298/dmtcs.2103openalex-snapshot
Parameterized complexity of synchronization and road coloring
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3311openalex-snapshot
Generating Synchronizing Automata with Large Reset Lengths
inferred← citeshttps://doi.org/10.48550/arxiv.1409.2003openalex-snapshot
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata
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.1704.04047openalex-snapshot
On the interplay between Babai and Cerny's conjectures
inferred← citeshttps://doi.org/10.48550/arxiv.1708.04864openalex-snapshot
Synchronizing automata and the language of minimal reset words
inferred← citeshttps://doi.org/10.48550/arxiv.1804.05439openalex-snapshot
Solvability of Mazes by Blind Robots
inferred← citeshttps://doi.org/10.48550/arxiv.1808.01711openalex-snapshot
On the Synchronization of Circular Semi-Flower Automata
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.