Boris Melnikov

From MaRDI portal
Person:174381

Available identifiers

zbMath Open melnikov.boris-fMaRDI QIDQ174381

List of research outcomes





PublicationDate of PublicationType
Pseudogeometric version of the traveling salesman problem, its application in quantum physics models and some heuristic algorithms for its solution2024-10-09Paper
https://portal.mardi4nfdi.de/entity/Q50149382021-12-08Paper
The loops of the basis finite automaton and the connected questions2017-10-27Paper
Iterations of languages and maximal prefix codes2016-11-25Paper
On an algorithm of constructing Conway's universal automaton2015-09-11Paper
Construction of finite universal automata. II: Examples of functioning of the algorithms2015-03-20Paper
Some algorithms for equivalent transformation of nondeterministic finite automata2014-10-21Paper
Some more algorithms for Conway's universal automaton2014-08-19Paper
Some more on the basis finite automaton2014-06-24Paper
Extended nondeterministic finite automata2011-06-10Paper
Once more on the edge-minimization of nondeterministic finite automata and the connected problems2011-06-10Paper
On an expansion of nondeterministic finite automata2007-10-22Paper
Multiheuristic approach to discrete optimization problems2007-07-05Paper
Description of special submonoids of the global supermonoid of a free monoid2005-08-26Paper
https://portal.mardi4nfdi.de/entity/Q48096002004-08-30Paper
Heuristics in programming of nondeterministic games2003-09-01Paper
https://portal.mardi4nfdi.de/entity/Q44089982003-06-29Paper
https://portal.mardi4nfdi.de/entity/Q45429192002-11-05Paper
https://portal.mardi4nfdi.de/entity/Q43301202002-05-15Paper
Edge-minimization of non-deterministic finite automata2002-01-07Paper
https://portal.mardi4nfdi.de/entity/Q45190382001-10-30Paper
Commutation in global supermonoid of free monoids2001-10-03Paper
A choice of strategy in nondeterministic antagonistic games2001-07-26Paper
Some grammatical structures of programming languages as simple bracketed languages2001-06-19Paper
https://portal.mardi4nfdi.de/entity/Q47188342000-01-04Paper
https://portal.mardi4nfdi.de/entity/Q42561101999-06-28Paper
https://portal.mardi4nfdi.de/entity/Q42287351999-05-17Paper
An algorithm for checking the equality of infinite catenations of finite languages1999-03-23Paper
https://portal.mardi4nfdi.de/entity/Q42213581999-03-14Paper
On an extension of the class of context-free languages1999-01-31Paper
On a classification of sequential context-free languages and grammars1995-09-25Paper
THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS1994-04-27Paper
On some corollaries of equivalence conditions of the unambiguous parenthesis grammars1992-06-26Paper

Research outcomes over time

This page was built for person: Boris Melnikov