On the public citation graph
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
0 signed · 63 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/3-540-45005-x_23openalex-snapshot
An Inverse Automata Algorithm for Recognizing 2-Collapsing Words
inferredcites →https://doi.org/10.1016/s0022-0000(73)80010-8openalex-snapshot
Establishing certain bounds concerning finite automata
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(99)00017-1openalex-snapshot
Optimal estimation on the order of local testability of finite automata
inferredcites →https://doi.org/10.1109/12.93741openalex-snapshot
A polynomial time algorithm for the local testability problem of deterministic finite automata
inferredcites →https://doi.org/10.1109/5.533956openalex-snapshot
Principles and methods of testing finite state machines-a survey
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.1145/157485.164978openalex-snapshot
Minimum length synchronizing sequences of finite state machine
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-319-15579-1_16openalex-snapshot
On the Synchronizing Probability Function and the Triple Rendezvous Time
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-53733-7_18openalex-snapshot
Finding DFAs with Maximal Shortest Synchronizing Word Length
inferred← citeshttps://doi.org/10.1007/978-3-319-55849-3_40openalex-snapshot
A New Evolutionary Algorithm for Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_8openalex-snapshot
DFAs and PFAs with Long Shortest Synchronizing Word Length
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_21openalex-snapshot
Synchronization of Some DFA
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_9openalex-snapshot
Shortest Synchronizing Strings for Huffman Codes
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-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-15155-2_7openalex-snapshot
Slowly Synchronizing Automata and Digraphs
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-38768-5_18openalex-snapshot
A Fast Algorithm Finding the Shortest Reset Words
inferred← citeshttps://doi.org/10.1007/978-3-642-39274-0_30openalex-snapshot
Generating Small Automata and the Černý Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_26openalex-snapshot
Synchronizing Automata with Extremal Properties
inferred← citeshttps://doi.org/10.1007/s10801-009-0185-0openalex-snapshot
Černý’s conjecture and group representation theory
inferred← citeshttps://doi.org/10.1007/s10878-013-9682-0openalex-snapshot
Computing the shortest reset words of synchronizing automata
inferred← citeshttps://doi.org/10.1007/s10958-013-1392-8openalex-snapshot
Primitive digraphs with large exponents and slowly synchronizing automata
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.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.eswa.2017.12.043openalex-snapshot
A machine learning approach to synchronization of automata
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104614openalex-snapshot
Slowly synchronizing automata with fixed alphabet size
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.04.042openalex-snapshot
Reconfiguration of Discrete Event Systems using Synchronizing Words
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.2016.05.009openalex-snapshot
Complexity of road coloring with prescribed reset words
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.06.005openalex-snapshot
Shortest synchronizing strings for Huffman codes
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.1137/15m1024603openalex-snapshot
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
inferred← citeshttps://doi.org/10.1142/s0129054116500167openalex-snapshot
Subset Synchronization and Careful Synchronization of Binary Finite Automata
inferred← citeshttps://doi.org/10.1142/s0129054119400021openalex-snapshot
Lower Bounds for Synchronizing Word Lengths in Partial Automata
inferred← citeshttps://doi.org/10.1142/s0129054120410051openalex-snapshot
The Synchronizing Probability Function for Primitive Sets of Matrices
inferred← citeshttps://doi.org/10.2478/v10149-011-0003-zopenalex-snapshot
Experiments on Synchronizing Automata
inferred← citeshttps://doi.org/10.3233/fi-2016-1357openalex-snapshot
Approximation of Reset Thresholds with Greedy Algorithms
inferred← citeshttps://doi.org/10.4204/eptcs.151.26openalex-snapshot
Subset Synchronization of Transitive Automata
inferred← citeshttps://doi.org/10.4236/ojdm.2012.22008openalex-snapshot
Some New Features and Algorithms for the Study of DFA
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.1207.2556openalex-snapshot
The Cerny conjecture for automata respecting intervals of a directed graph
inferred← citeshttps://doi.org/10.48550/arxiv.1301.2092openalex-snapshot
The Černý conjecture for small automata: experimental report
inferred← citeshttps://doi.org/10.48550/arxiv.1308.1978openalex-snapshot
A New Heuristic Synchronizing Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3311openalex-snapshot
Generating Synchronizing Automata with Large Reset Lengths
inferred← citeshttps://doi.org/10.48550/arxiv.1410.4034openalex-snapshot
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1703.07618openalex-snapshot
DFAs and PFAs with Long Shortest Synchronizing Word Length
inferred← citeshttps://doi.org/10.48550/arxiv.2011.05575openalex-snapshot
Some new Features and Algorithms for the Study of DFA
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.