The following pages link to V. A. Buevich (Q2513014):
Displayed 17 items.
- A problem of completeness of S-sets of deterministic functions (Q2513016) (← links)
- Description of a finite automaton by means of a finite set of input- output sequences. I,II (Q2543325) (← links)
- On the algorithmic undecidability of A-completeness for the boundedly determinate functions (Q2562181) (← links)
- A new version of the proof of completeness criterion for k-valued logic functions (Q3125967) (← links)
- (Q3589276) (← links)
- (Q3677665) (← links)
- (Q3783585) (← links)
- (Q3939242) (← links)
- (Q4090261) (← links)
- (Q4278630) (← links)
- The completeness criterion for systems which contain all one-place finite-automaton functions (Q4809508) (← links)
- On algorithmic solvability of the A-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate S-functions (Q5299971) (← links)
- (Q5445414) (← links)
- (Q5445418) (← links)
- (Q5597531) (← links)
- (Q5659461) (← links)
- (Q5663852) (← links)