On the public citation graph
Adaptive Homing is in P
0 signed · 24 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/11754008_16openalex-snapshot
FSM Test Translation Through Context
inferredcites →https://doi.org/10.1007/978-0-387-68759-9openalex-snapshot
The Unknown Component Problem: Theory and Applications
inferredcites →https://doi.org/10.1007/978-3-540-88282-4_4openalex-snapshot
Synchronizing Automata and the Černý Conjecture
inferredcites →https://doi.org/10.1007/978-3-642-22256-6_20openalex-snapshot
Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines
inferredcites →https://doi.org/10.1007/978-3-642-24580-0_12openalex-snapshot
Adaptive Testing of Deterministic Implementations Specified by Nondeterministic FSMs
inferredcites →https://doi.org/10.1007/bf01071771openalex-snapshot
In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
inferredcites →https://doi.org/10.1007/s10009-014-0357-7openalex-snapshot
On adaptive experiments for nondeterministic finite state machines
inferredcites →https://doi.org/10.1016/s0019-9958(61)80003-xopenalex-snapshot
State-identification experiments in finite automata
inferredcites →https://doi.org/10.1017/cbo9780511816239openalex-snapshot
Switching and Finite Automata Theory
inferredcites →https://doi.org/10.1134/s0361768814060140openalex-snapshot
On the complexity of existence of homing sequences for nondeterministic finite state machines
inferredcites →https://doi.org/10.1145/321088.321098openalex-snapshot
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on 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-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-031-13502-6_12openalex-snapshot
Adaptive Experiments for State Identification in Finite State Machines with Timeouts
inferred← citeshttps://doi.org/10.1007/978-3-319-25945-1_15openalex-snapshot
Heuristics for Deriving Adaptive Homing and Distinguishing Sequences for Nondeterministic Finite State Machines
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.1007/s11704-022-1673-9openalex-snapshot
Complexity of adaptive testing in scenarios defined extensionally
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.100502openalex-snapshot
Introducing complexity to formal testing
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/tc.2021.3058302openalex-snapshot
Homing Sequence Derivation With Quantified Boolean Satisfiability
inferred← citeshttps://doi.org/10.18255/1818-1015-2020-4-376-395openalex-snapshot
Deriving Homing Sequences for Finite State Machines with Timed Guards
inferred← citeshttps://doi.org/10.3103/s0146411621070154openalex-snapshot
Deriving Homing Sequences for Finite State Machines with Timed Guards
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.