On the public citation graph
Subset Synchronization of Transitive Automata
0 signed · 33 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/11498490_2openalex-snapshot
1 Homing and Synchronizing Sequences
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/978-3-642-22256-6_22openalex-snapshot
Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata
inferredcites →https://doi.org/10.1007/978-3-642-22953-4_15openalex-snapshot
Modifying the Upper Bound on the Length of Minimal Synchronizing Word
inferredcites →https://doi.org/10.1007/bf02761605openalex-snapshot
Equivalence of topological Markov shifts
inferredcites →https://doi.org/10.1007/s00224-013-9511-yopenalex-snapshot
Approximating the Minimum Length of Synchronizing Words Is Hard
inferredcites →https://doi.org/10.1007/s00224-013-9516-6openalex-snapshot
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata
inferredcites →https://doi.org/10.1007/s10955-011-0342-4openalex-snapshot
Exact Synchronization for Finite-State Sources
inferredcites →https://doi.org/10.1016/0304-3975(94)90029-9openalex-snapshot
On the effects of noise and speed on computations
inferredcites →https://doi.org/10.1016/j.amc.2008.06.019openalex-snapshot
Synchronizing finite automata with short reset words
inferredcites →https://doi.org/10.1016/j.ic.2015.04.001openalex-snapshot
Existence of constants in regular splicing languages
inferredcites →https://doi.org/10.1016/j.ipl.2009.05.007openalex-snapshot
Improved upper bounds on synchronizing nondeterministic automata
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-0208(08)73432-7openalex-snapshot
On two Combinatorial Problems Arising from Automata Theory
inferredcites →https://doi.org/10.1016/s0304-3975(01)00227-4openalex-snapshot
Composition sequences for functions over a finite domain
inferredcites →https://doi.org/10.1051/ita/1982160403651openalex-snapshot
A game of composing binary relations
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/12.272431openalex-snapshot
Testing finite-state machines: state identification and verification
inferredcites →https://doi.org/10.1109/sfcs.1977.16openalex-snapshot
Lower bounds for natural proof systems
inferredcites →https://doi.org/10.1109/sfcs.1986.5openalex-snapshot
An algorithmic approach to the automated design of parts orienters
inferredcites →https://doi.org/10.1137/0219033openalex-snapshot
Reset Sequences for Monotonic Automata
inferredcites →https://doi.org/10.3103/s1066369x10010056openalex-snapshot
A lower bound for the length of the shortest carefully synchronizing words
inferredcites →https://doi.org/10.4007/annals.2014.179.2.4openalex-snapshot
On the diameter of permutation groups
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-40946-7_15openalex-snapshot
Experiments with 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.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.tcs.2018.12.026openalex-snapshot
Synchronization problems in automata without non-trivial cycles
inferred← citeshttps://doi.org/10.12988/ams.2017.77232openalex-snapshot
On the synchronization of small sets of states
inferred← citeshttps://doi.org/10.48550/arxiv.1608.00889openalex-snapshot
Approximating the Maximum Number of Synchronizing States in Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1612.04462openalex-snapshot
On the synchronization of planar automata
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.1805.02540openalex-snapshot
On Completely Reachable Automata and Subset Reachability
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.