The following pages link to B. F. Mel'nikov (Q174381):
Displayed 34 items.
- (Q399500) (redirect page) (← links)
- Some more algorithms for Conway's universal automaton (Q399502) (← links)
- Some algorithms for equivalent transformation of nondeterministic finite automata (Q462609) (← links)
- On some corollaries of equivalence conditions of the unambiguous parenthesis grammars (Q1179632) (← links)
- On an extension of the class of context-free languages (Q1276509) (← links)
- An algorithm for checking the equality of infinite catenations of finite languages (Q1281246) (← links)
- (Q1403200) (redirect page) (← links)
- Heuristics in programming of nondeterministic games (Q1403201) (← links)
- On a classification of sequential context-free languages and grammars (Q1898611) (← links)
- Multiheuristic approach to discrete optimization problems (Q2371698) (← links)
- Description of special submonoids of the global supermonoid of a free monoid (Q2387095) (← links)
- On an expansion of nondeterministic finite automata (Q2454972) (← links)
- (Q2718446) (← links)
- (Q2718458) (← links)
- (Q2761606) (← links)
- (Q2833908) (← links)
- (Q2942967) (← links)
- (Q3005906) (← links)
- (Q3005907) (← links)
- (Q4221358) (← links)
- (Q4228735) (← links)
- (Q4256110) (← links)
- THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS (Q4286113) (← links)
- (Q4330120) (← links)
- (Q4408998) (← links)
- (Q4519038) (← links)
- (Q4542919) (← links)
- (Q4718834) (← links)
- (Q4809600) (← links)
- Some more on the basis finite automaton (Q4981717) (← links)
- (Q5014938) (← links)
- (Q5179435) (← links)
- (Q5373771) (← links)
- A choice of strategy in nondeterministic antagonistic games (Q5930952) (← links)