On the public citation graph
1 Homing and Synchronizing Sequences
0 signed · 120 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.1006/inco.1993.1021openalex-snapshot
Inference of Finite Automata Using Homing Sequences
inferredcites →https://doi.org/10.1007/bf02761605openalex-snapshot
Equivalence of topological Markov shifts
inferredcites →https://doi.org/10.1109/12.272431openalex-snapshot
Testing finite-state machines: state identification and verification
inferredcites →https://doi.org/10.1109/edac.1993.386426openalex-snapshot
Multiple observation time single reference test generation using synchronizing sequences
inferredcites →https://doi.org/10.1137/0219033openalex-snapshot
Reset Sequences for Monotonic Automata
inferredcites →https://doi.org/10.1145/321088.321098openalex-snapshot
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
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-030-13435-8_1openalex-snapshot
Modern Aspects of Complexity Within Formal Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-25972-3_5openalex-snapshot
Detectability of Boolean Control Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_16openalex-snapshot
On Codeword Lengths Guaranteeing Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-030-31280-0_6openalex-snapshot
Evaluating the Complexity of Deriving Adaptive Homing, Synchronizing and Distinguishing Sequences for Nondeterministic FSMs
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_37openalex-snapshot
Computational Complexity of Synchronization Under Regular Commutative Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_24openalex-snapshot
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_25openalex-snapshot
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_17openalex-snapshot
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_19openalex-snapshot
Computational Complexity of Synchronization Under Sparse Regular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_15openalex-snapshot
Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata
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-07469-1_18openalex-snapshot
Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents
inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_8openalex-snapshot
Some Results Concerning Careful Synchronization of Partial Automata and Subset Synchronization of DFA’s
inferred← citeshttps://doi.org/10.1007/978-3-031-13257-5_7openalex-snapshot
Reset Complexity and Completely Reachable Automata with Simple Idempotents
inferred← citeshttps://doi.org/10.1007/978-3-031-13502-6_12openalex-snapshot
Adaptive Experiments for State Identification in Finite State Machines with Timeouts
inferred← citeshttps://doi.org/10.1007/978-3-031-33264-7_10openalex-snapshot
Synchronization of Parikh Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-33264-7_11openalex-snapshot
Completely Distinguishable Automata and the Set of Synchronizing Words
inferred← citeshttps://doi.org/10.1007/978-3-031-33264-7_17openalex-snapshot
Synchronizing Automata with Coinciding Cycles
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-08846-4_15openalex-snapshot
Reset Thresholds of Automata with Two Cycle Lengths
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_7openalex-snapshot
Synchronizing Automata with Random Inputs
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_27openalex-snapshot
Complexity of Checking Whether Two Automata Are Synchronized by the Same Language
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-22360-5_23openalex-snapshot
Checking Whether an Automaton Is Monotonic Is NP-complete
inferred← citeshttps://doi.org/10.1007/978-3-319-40946-7_8openalex-snapshot
Problems on Finite Automata and the Exponential Time Hypothesis
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-60134-2_16openalex-snapshot
Synchronization Problems in Automata Without Non-trivial Cycles
inferred← citeshttps://doi.org/10.1007/978-3-319-60252-3_21openalex-snapshot
Reset Complexity of Ideal Languages Over a Binary Alphabet
inferred← citeshttps://doi.org/10.1007/978-3-319-67549-7_14openalex-snapshot
Homing Sequence Derivation with Quantified Boolean Satisfiability
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-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-00982-2_57openalex-snapshot
Finitely Generated Synchronizing Automata
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-21875-0_24openalex-snapshot
Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_20openalex-snapshot
Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines
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-29347-4_49openalex-snapshot
Application of Hierarchical Classifier to Minimal Synchronizing Word Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_14openalex-snapshot
P(l)aying for Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_15openalex-snapshot
Synchronizing Automata of Bounded Rank
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_25openalex-snapshot
A Multivariate Analysis of Some DFA Problems
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_20openalex-snapshot
On the Length of Homing Sequences for Nondeterministic Finite State Machines
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-642-40579-2_16openalex-snapshot
Finitely Generated Ideal Languages and Synchronizing Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-41707-8_3openalex-snapshot
Adaptive Homing and Distinguishing Experiments for Nondeterministic Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_14openalex-snapshot
Synchronizing Strategies under Partial Observability
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_15openalex-snapshot
Synchronizing Automata over Nested Words
inferred← citeshttps://doi.org/10.1007/s00165-014-0297-8openalex-snapshot
The relation between preset distinguishing sequences and synchronizing sequences
inferred← citeshttps://doi.org/10.1007/s10626-022-00362-8openalex-snapshot
Detectability of labeled weighted automata over monoids
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/s10955-011-0342-4openalex-snapshot
Exact Synchronization for Finite-State Sources
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.1007/s10958-013-1396-4openalex-snapshot
Synchronizing random automata on a 4-letter alphabet
inferred← citeshttps://doi.org/10.1007/s11219-014-9242-6openalex-snapshot
Fault domain-based testing in imperfect situations: a heuristic approach and case studies
inferred← citeshttps://doi.org/10.1007/s11219-021-09548-zopenalex-snapshot
Evaluating the complexity of deriving adaptive $$S'$$-homing and $$S'$$-synchronizing sequences for nondeterministic FSMs
inferred← citeshttps://doi.org/10.1016/j.automatica.2017.03.023openalex-snapshot
The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
inferred← citeshttps://doi.org/10.1016/j.bica.2018.04.005openalex-snapshot
Surprise-based learning of state representations
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.entcs.2008.12.039openalex-snapshot
The Length of Subset Reachability in Nondeterministic Automata
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.2023.105089openalex-snapshot
Synchronizing deterministic push-down automata can be really hard
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.909openalex-snapshot
Detectability of Nondeterministic Finite Transition Systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.07.001openalex-snapshot
The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
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.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.2009.06.005openalex-snapshot
Shortest synchronizing strings for Huffman codes
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.1016/j.tcs.2021.08.030openalex-snapshot
Constrained synchronization and commutativity
inferred← citeshttps://doi.org/10.1017/s0960129522000184openalex-snapshot
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
inferred← citeshttps://doi.org/10.1093/comjnl/bxac069openalex-snapshot
Deriving homing sequences for Finite State Machines with timeouts
inferred← citeshttps://doi.org/10.1109/codit66093.2025.11321859openalex-snapshot
Synchronizing Sequence Computation Under Forbidden Event Constraints
inferred← citeshttps://doi.org/10.1109/ewdts.2019.8884403openalex-snapshot
Deriving adaptive homing sequences for weakly initialized nondeterministic FSMs
inferred← citeshttps://doi.org/10.1109/ewdts50664.2020.9225043openalex-snapshot
Evaluating Length of a Shortest Adaptive Homing Sequence for Weakly Initialized FSMs
inferred← citeshttps://doi.org/10.1109/iccad45719.2019.8942078openalex-snapshot
Time-Frame Folding: Back to the Sequentiality
inferred← citeshttps://doi.org/10.1109/icws72778.2026.00130openalex-snapshot
Minimizing Execution Delays in Configuration Management Systems via TFSM Synchronizing and Homing Sequences
inferred← citeshttps://doi.org/10.1109/rusautocon54946.2022.9896240openalex-snapshot
Using Homing Traces for Simplifying Passive Testing of Discrete Event Systems
inferred← citeshttps://doi.org/10.1109/syscon.2015.7116735openalex-snapshot
Partitioning the requirements of embedded systems by input/output dependency analysis for compositional creation of parallel test models
inferred← citeshttps://doi.org/10.1109/tc.2021.3058302openalex-snapshot
Homing Sequence Derivation With Quantified Boolean Satisfiability
inferred← citeshttps://doi.org/10.1134/s0001434611090094openalex-snapshot
Slowly synchronizing automata with zero and noncomplete sets
inferred← citeshttps://doi.org/10.1134/s0005117923060048openalex-snapshot
On Preset Homing and Synchronizing Sequences for Observable Input/Output Automata
inferred← citeshttps://doi.org/10.1134/s0361768814060140openalex-snapshot
On the complexity of existence of homing sequences for nondeterministic finite state machines
inferred← citeshttps://doi.org/10.1142/s0129054109006942openalex-snapshot
THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA
inferred← citeshttps://doi.org/10.1142/s0129054113400170openalex-snapshot
P(L)AYING FOR SYNCHRONIZATION
inferred← citeshttps://doi.org/10.1142/s0129054115400080openalex-snapshot
Reset Thresholds of Automata with Two Cycle Lengths
inferred← citeshttps://doi.org/10.1142/s0129054116500167openalex-snapshot
Subset Synchronization and Careful Synchronization of Binary Finite Automata
inferred← citeshttps://doi.org/10.1142/s0129054119400343openalex-snapshot
Reset Complexity of Ideal Languages Over a Binary Alphabet
inferred← citeshttps://doi.org/10.1142/s0129054123450053openalex-snapshot
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
inferred← citeshttps://doi.org/10.1145/2694344.2694369openalex-snapshot
On-the-Fly Principled Speculation for FSM Parallelization
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26361openalex-snapshot
Synchronization and Diversity of Solutions
inferred← citeshttps://doi.org/10.25596/jalc-2019-287openalex-snapshot
Extensions to Minimal Synchronizing Words
inferred← citeshttps://doi.org/10.3103/s0146411618070167openalex-snapshot
Deriving Synchronizing and Homing Sequences for Input/Output Automata
inferred← citeshttps://doi.org/10.3103/s0146411621070154openalex-snapshot
Deriving Homing Sequences for Finite State Machines with Timed Guards
inferred← citeshttps://doi.org/10.31857/s0005231023060041openalex-snapshot
On Preset Homing and Synchronizing Sequences for Observable Input/Output Automata
inferred← citeshttps://doi.org/10.3390/a10010024openalex-snapshot
Problems on Finite Automata and the Exponential Time Hypothesis
inferred← citeshttps://doi.org/10.3850/9783981537079_0529openalex-snapshot
Topaz: Mining High-Level Safety Properties from Logic Simulation Traces
inferred← citeshttps://doi.org/10.4204/eptcs.151.26openalex-snapshot
Subset Synchronization of Transitive Automata
inferred← citeshttps://doi.org/10.4213/mzm6191openalex-snapshot
Медленно синхронизируемые автоматы с нулем и непокрывающие множества
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2020.58openalex-snapshot
Synchronization Under Dynamic Constraints
inferred← citeshttps://doi.org/10.46298/dmtcs.16465openalex-snapshot
Synchronization of strongly connected partial DFAs and prefix codes
inferred← citeshttps://doi.org/10.46298/dmtcs.2103openalex-snapshot
Parameterized complexity of synchronization and road coloring
inferred← citeshttps://doi.org/10.48550/arxiv.0907.4576openalex-snapshot
Slowly synchronizing automata with zero and incomplete sets
inferred← citeshttps://doi.org/10.48550/arxiv.1305.0336openalex-snapshot
Finitely generated ideal languages and synchronizing automata
inferred← citeshttps://doi.org/10.48550/arxiv.1308.1978openalex-snapshot
A New Heuristic Synchronizing Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1403.3992openalex-snapshot
Reset thresholds of automata with two cycle lengths
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.2001.04729openalex-snapshot
A unified method to decentralized state inference and fault diagnosis/prediction of discrete-event systems
inferred← citeshttps://doi.org/10.48550/arxiv.2006.01903openalex-snapshot
On a Class of Constrained Synchronization Problems in NP
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.70675/bc491e0czbb66z4068zb389z2dd217d423caopenalex-snapshot
Synchronizing sequences for unbounded synchronized Petri nets
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.