On the public citation graph

The \v Cerný conjecture for aperiodic automata

0 signed · 72 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.
Claim with ORCID
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.
See reference health

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/3-540-44683-4_38openalex-snapshot
Synchronizing Finite Automata on Eulerian Digraphs
inferredcites →https://doi.org/10.1007/bf02366314openalex-snapshot
Almost optimal bound of recurrent word length for regular automata
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
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.1016/s0304-3975(02)00405-xopenalex-snapshot
Synchronizing finite automata on Eulerian digraphs
inferredcites →https://doi.org/10.1016/s0304-3975(96)00136-3openalex-snapshot
Reset words for commutative and solvable automata
inferredcites →https://doi.org/10.1051/ita/1998321-300211openalex-snapshot
Sur les automates circulaires et la conjecture de Černý
inferredcites →https://doi.org/10.1137/0219033openalex-snapshot
Reset Sequences for Monotonic Automata
inferredcites →https://doi.org/10.1142/9789812702616_0002openalex-snapshot
SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
inferredcites →https://doi.org/10.3217/jucs-008-02-0332openalex-snapshot
Generation of Constants and Synchronization of Finite 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/11779148_39openalex-snapshot
Synchronizing Automata with a Letter of Deficiency 2
inferred← citeshttps://doi.org/10.1007/978-3-030-93489-7_4openalex-snapshot
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-66159-4_18openalex-snapshot
Careful Synchronization of One-Cluster Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_16openalex-snapshot
On the Synchronizing Probability Function and the Triple Rendezvous Time
inferred← citeshttps://doi.org/10.1007/978-3-319-60134-2_16openalex-snapshot
Synchronization Problems in Automata Without Non-trivial Cycles
inferred← citeshttps://doi.org/10.1007/978-3-540-76336-9_5openalex-snapshot
Synchronizing Automata Preserving a Chain of Partial Orders
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-540-88282-4_4openalex-snapshot
Synchronizing Automata and the Černý Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_5openalex-snapshot
Matrix Mortality and the Černý-Pin Conjecture
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/978-3-642-14455-4_38openalex-snapshot
The Averaging Trick and the Černý Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_8openalex-snapshot
On a Conjecture by Carpi and D’Alessandro
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_15openalex-snapshot
Modifying the Upper Bound on the Length of Minimal Synchronizing Word
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_16openalex-snapshot
Lower Bounds for the Length of Reset Words in Eulerian Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_15openalex-snapshot
Synchronizing Automata of Bounded Rank
inferred← citeshttps://doi.org/10.1007/s00236-009-0106-7openalex-snapshot
Strongly transitive automata and the Černý conjecture
inferred← citeshttps://doi.org/10.1007/s10801-009-0185-0openalex-snapshot
Černý’s conjecture and group representation theory
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.2012.07.003openalex-snapshot
Independent sets of words and the synchronization problem
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.ejc.2012.03.004openalex-snapshot
Recent results on syntactic groups of prefix codes
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.eswa.2017.12.043openalex-snapshot
A machine learning approach to synchronization of automata
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.020openalex-snapshot
A series of slowly synchronizing automata with a zero state over a small alphabet
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104817openalex-snapshot
Extremal synchronizing circular automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.12.027openalex-snapshot
A multi-parameter analysis of hard problems on deterministic finite automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.08.002openalex-snapshot
Preimage problems for deterministic finite automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.02.007openalex-snapshot
Analytic methods for reachability problems
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.01.006openalex-snapshot
Primitive groups synchronize non-uniform maps of extreme ranks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.01.010openalex-snapshot
Synchronizing automata with a letter of deficiency 2
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.021openalex-snapshot
Synchronizing automata preserving a chain of partial orders
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.012openalex-snapshot
The Černý conjecture for one-cluster automata with prime length cycle
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.016openalex-snapshot
Groups synchronizing a transformation of non-uniform kernel
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.026openalex-snapshot
Synchronization problems in automata without non-trivial cycles
inferred← citeshttps://doi.org/10.1017/cbo9781316227343.006openalex-snapshot
Permutation groups and transformation semigroups: results and problems
inferred← citeshttps://doi.org/10.1137/100816109openalex-snapshot
The Synchronizing Probability Function of an Automaton
inferred← citeshttps://doi.org/10.1137/15m1024603openalex-snapshot
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
inferred← citeshttps://doi.org/10.12988/ams.2018.8794openalex-snapshot
Automata specialities: Cerny automata
inferred← citeshttps://doi.org/10.12988/ija.2013.13010openalex-snapshot
A sequence of weakly monotonic automata with increasing level
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.3103/s1066369x10010019openalex-snapshot
The annulation threshold for partially monotonic automata
inferred← citeshttps://doi.org/10.4213/rm10005openalex-snapshot
Синхронизация конечных автоматов
inferred← citeshttps://doi.org/10.4213/rm10005eopenalex-snapshot
Synchronization of finite automata
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2020.58openalex-snapshot
Synchronization Under Dynamic Constraints
inferred← citeshttps://doi.org/10.46298/dmtcs.619openalex-snapshot
The Cerný conjecture for automata respecting intervals of a directed graph
inferred← citeshttps://doi.org/10.48550/arxiv.0808.1429openalex-snapshot
Cerny's conjecture, synchronizing automata, group representation theory
inferred← citeshttps://doi.org/10.48550/arxiv.0909.3790openalex-snapshot
On Carpi and Alessandro conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1207.2556openalex-snapshot
The Cerny conjecture for automata respecting intervals of a directed graph
inferred← citeshttps://doi.org/10.48550/arxiv.1306.4827openalex-snapshot
Primitive Groups Synchronize Non-uniform Maps of Extreme Ranks
inferred← citeshttps://doi.org/10.48550/arxiv.1312.6146openalex-snapshot
Generating Shortest Synchronizing Sequences using Answer Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1609.06853openalex-snapshot
Slowly synchronizing automata with fixed alphabet size
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.1708.04864openalex-snapshot
Synchronizing automata and the language of minimal reset words
inferred← citeshttps://doi.org/10.48550/arxiv.1808.01711openalex-snapshot
On the Synchronization of Circular Semi-Flower Automata
inferred← citeshttps://doi.org/10.48550/arxiv.2003.06177openalex-snapshot
Cerny-Starke conjecture from the sixties of XX century
inferred← citeshttps://doi.org/10.48550/arxiv.2109.02743openalex-snapshot
Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents
inferred← citeshttps://doi.org/10.48550/arxiv.2110.06839openalex-snapshot
The algebra of row monomial matrices
inferred← citeshttps://doi.org/10.70675/f26a3dcfz905dz4f2ezaa66z0d530549012fopenalex-snapshot
Synchronizing automata and coding theory
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.