On the public citation graph

Cornering Robots to Synchronize a Dfa

https://doi.org/10.2139/ssrn.4819005

0 signed · 16 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/978-1-4612-1025-2openalex-extracted

The Mathematics of Nonlinear Programming

inferredcites →https://doi.org/10.1007/978-3-642-22953-4_15openalex-extracted

Modifying the Upper Bound on the Length of Minimal Synchronizing Word

inferredcites →https://doi.org/10.1016/0095-8956(89)90066-xopenalex-extracted

Radius, diameter, and minimum degree

inferredcites →https://doi.org/10.1016/j.aml.2011.08.010openalex-extracted

A note on diameter and the degree sequence of a graph

inferredcites →https://doi.org/10.1016/j.tcs.2004.03.068openalex-extracted

Synchronizing monotonic automata

inferredcites →https://doi.org/10.1016/j.tcs.2004.09.006openalex-extracted

Synchronizing generalized monotonic automata

inferredcites →https://doi.org/10.1016/s0195-6698(82)80025-5openalex-extracted

An Extremal Problem for two Families of Sets

inferredcites →https://doi.org/10.1016/s0304-0208(08)73432-7openalex-extracted

On two Combinatorial Problems Arising from Automata Theory

inferredcites →https://doi.org/10.1016/s0304-3975(02)00405-xopenalex-extracted

Synchronizing finite automata on Eulerian digraphs

inferredcites →https://doi.org/10.1051/ita/1998321-300211openalex-extracted

Sur les automates circulaires et la conjecture de Černý

inferredcites →https://doi.org/10.1137/0219033openalex-extracted

Reset Sequences for Monotonic Automata

inferredcites →https://doi.org/10.21236/ad0401924openalex-extracted

STUDY ON APPLICATION OF CODING THEORY

inferredcites →https://doi.org/10.25596/jalc-2019-367openalex-extracted

An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata

inferredcites →https://doi.org/10.4213/rm10005openalex-extracted

Синхронизация конечных автоматов

inferredcites →https://doi.org/10.4230/lipics.stacs.2018.56openalex-extracted

Improving the Upper Bound on the Length of the Shortest Reset Word

inferredcites →https://doi.org/10.5860/choice.26-0358openalex-extracted

The mathematics of nonlinear programming

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.