The following pages link to Nina Yevtushenko (Q413310):
Displaying 23 items.
- Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs (Q413312) (← links)
- Compositionally progressive solutions of synchronous FSM equations (Q1020554) (← links)
- Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation (Q1707350) (← links)
- Adaptive experiments for state identification in finite state machines with timeouts (Q2104144) (← links)
- The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs (Q2398505) (← links)
- Progressive solutions to a parallel automata equation (Q2508960) (← links)
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (Q2947421) (← links)
- The Unknown Component Problem (Q3114245) (← links)
- Conformance Tests as Checking Experiments for Partial Nondeterministic FSM (Q3434606) (← links)
- FSM Test Translation Through Context (Q3434661) (← links)
- Progressive Solutions to a Parallel Automata Equation (Q3564943) (← links)
- Progressive Solutions to FSM Equations (Q3602822) (← links)
- (Q4437059) (← links)
- (Q4437065) (← links)
- Automated Synthesis of Protocol Converters with BALM-II (Q4988649) (← links)
- (Q4995370) (← links)
- Homing Sequence Derivation With Quantified Boolean Satisfiability (Q5094969) (← links)
- Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines (Q5200066) (← links)
- On the Length of Homing Sequences for Nondeterministic Finite State Machines (Q5327497) (← links)
- Distinguishing Experiments for Timed Nondeterministic Finite State Machines (Q5414484) (← links)
- Formal Techniques for Networked and Distributed Systems – FORTE 2004 (Q5464470) (← links)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479157) (← links)
- Equivalence checking and intersection of deterministic timed finite state machines (Q6108432) (← links)
