Boris Melnikov

Available identifiers

zbMath Open melnikov.boris-fMaRDI QIDQ174381

List of research outcomes

Publication	Date of Publication	Type
Pseudogeometric version of the traveling salesman problem, its application in quantum physics models and some heuristic algorithms for its solution	2024-10-09	Paper
https://portal.mardi4nfdi.de/entity/Q5014938	2021-12-08	Paper
The loops of the basis finite automaton and the connected questions	2017-10-27	Paper
Iterations of languages and maximal prefix codes	2016-11-25	Paper
On an algorithm of constructing Conway's universal automaton	2015-09-11	Paper
Construction of finite universal automata. II: Examples of functioning of the algorithms	2015-03-20	Paper
Some algorithms for equivalent transformation of nondeterministic finite automata	2014-10-21	Paper
Some more algorithms for Conway's universal automaton	2014-08-19	Paper
Some more on the basis finite automaton	2014-06-24	Paper
Extended nondeterministic finite automata	2011-06-10	Paper
Once more on the edge-minimization of nondeterministic finite automata and the connected problems	2011-06-10	Paper
On an expansion of nondeterministic finite automata	2007-10-22	Paper
Multiheuristic approach to discrete optimization problems	2007-07-05	Paper
Description of special submonoids of the global supermonoid of a free monoid	2005-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q4809600	2004-08-30	Paper
Heuristics in programming of nondeterministic games	2003-09-01	Paper
https://portal.mardi4nfdi.de/entity/Q4408998	2003-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4542919	2002-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q4330120	2002-05-15	Paper
Edge-minimization of non-deterministic finite automata	2002-01-07	Paper
https://portal.mardi4nfdi.de/entity/Q4519038	2001-10-30	Paper
Commutation in global supermonoid of free monoids	2001-10-03	Paper
A choice of strategy in nondeterministic antagonistic games	2001-07-26	Paper
Some grammatical structures of programming languages as simple bracketed languages	2001-06-19	Paper
https://portal.mardi4nfdi.de/entity/Q4718834	2000-01-04	Paper
https://portal.mardi4nfdi.de/entity/Q4256110	1999-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q4228735	1999-05-17	Paper
An algorithm for checking the equality of infinite catenations of finite languages	1999-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q4221358	1999-03-14	Paper
On an extension of the class of context-free languages	1999-01-31	Paper
On a classification of sequential context-free languages and grammars	1995-09-25	Paper
THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS	1994-04-27	Paper
On some corollaries of equivalence conditions of the unambiguous parenthesis grammars	1992-06-26	Paper

Research outcomes over time

This page was built for person: Boris Melnikov