The following pages link to A. S. Barashko (Q199852):
Displaying 34 items.
- Compactness of functional equivalence of liberal program schemes (Q1052080) (← links)
- A variational approach to hazard detection in asynchronous sequential circuits (Q1059047) (← links)
- Statistical recognition of automata as a function of the length of the analyzed input sequence fragment (Q1068545) (← links)
- Statistical input-output equivalence of automata (Q1102753) (← links)
- Infimums of step-counting functions of enumeration of sets (Q1170187) (← links)
- Representation of multichannel signature analyzers by linear polynomials over finite fields (Q1280895) (← links)
- Generalized approach to statistical recognition of automata (Q1286275) (← links)
- Polynomials generating Hamming codes (Q1336018) (← links)
- Some useful properties of signature analyzers (Q1816358) (← links)
- Asymptotic optimality of linear signature analyzers with respect to stationary errors (Q1842410) (← links)
- Mathematical principles of testing discrete devices by fragment counting (Q1905127) (← links)
- Dependence of asymptotic optimality of signature analyzers on error distribution (Q1922341) (← links)
- On componentwise diagnosable decompositions of an automaton (Q2543819) (← links)
- New conditions of nonredundance and equivalence of signature analyzers (Q2740493) (← links)
- (Q3214427) (← links)
- (Q3786422) (← links)
- Rank and statistical mapping of a strongly connected automaton (Q3802631) (← links)
- (Q3804607) (← links)
- (Q3890678) (← links)
- On the theory of signature analyzers (Q4007470) (← links)
- (Q4053111) (← links)
- (Q4085716) (← links)
- (Q4122798) (← links)
- (Q4125774) (← links)
- (Q4194950) (← links)
- (Q4274146) (← links)
- (Q4769998) (← links)
- (Q4817704) (← links)
- (Q5605234) (← links)
- (Q5631026) (← links)
- (Q5645338) (← links)
- (Q5645339) (← links)
- Generalized statistical equivalence of automata (Q5942040) (← links)
- A type of isomorphism between linear and nonlinear signature analyzers (Q5951282) (← links)
