On the public citation graph

In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton

0 signed · 34 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.1016/0097-3165(74)90018-1openalex-snapshot
Solution of a problem of A. Ehrenfeucht and J. Mycielski
inferredcites →https://doi.org/10.1016/s0022-0000(73)80010-8openalex-snapshot
Establishing certain bounds concerning finite automata
inferredcites →https://doi.org/10.1109/swat.1970.22openalex-snapshot
Synchronizing and representation problems for sequential machines with masked outputs
inferredcites →https://doi.org/10.1287/moor.7.2.159openalex-snapshot
Closure in Independence Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-46011-x_14openalex-snapshot
A Note on Synchronized Automata and Road Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_5openalex-snapshot
Words of Minimum Rank in Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-22360-5_16openalex-snapshot
Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata
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-319-98654-8_31openalex-snapshot
Dynamics of the Independence Number and Automata Synchronization
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-00982-2_58openalex-snapshot
Genetic Algorithm for Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_17openalex-snapshot
Approximating Minimum Reset Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_9openalex-snapshot
COMPAS - A Computing Package for Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-642-29347-4_49openalex-snapshot
Application of Hierarchical Classifier to Minimal Synchronizing Word Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-39274-0_20openalex-snapshot
On the Length of Homing Sequences for Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.1007/bf02366314openalex-snapshot
Almost optimal bound of recurrent word length for regular automata
inferred← citeshttps://doi.org/10.1016/j.eswa.2012.04.079openalex-snapshot
Effective synchronizing algorithms
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.07.071openalex-snapshot
Forward and backward synchronizing algorithms
inferred← citeshttps://doi.org/10.1016/j.ins.2016.07.049openalex-snapshot
Algebraic synchronization criterion and computing reset words
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00136-3openalex-snapshot
Reset words for commutative and solvable automata
inferred← citeshttps://doi.org/10.1137/16m1094099openalex-snapshot
Primitive Sets of Nonnegative Matrices and Synchronizing Automata
inferred← citeshttps://doi.org/10.1142/9789812704979_0023openalex-snapshot
Words guaranteeing minimal image
inferred← citeshttps://doi.org/10.1142/s0129054102001217openalex-snapshot
A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM
inferred← citeshttps://doi.org/10.1142/s0129054104002406openalex-snapshot
WORDS GUARANTEEING MINIMUM IMAGE
inferred← citeshttps://doi.org/10.4204/eptcs.180.5openalex-snapshot
Adaptive Homing is in P
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.46298/dmtcs.2101openalex-snapshot
A note on a recent attempt to improve the Pin-Frankl bound
inferred← citeshttps://doi.org/10.48550/arxiv.1412.0975openalex-snapshot
A Note on a Recent Attempt to Improve the Pin-Frankl Bound
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.70675/bc491e0czbb66z4068zb389z2dd217d423caopenalex-snapshot
Synchronizing sequences for unbounded synchronized Petri nets
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.