| 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 |
| Construction of universal finite automata. I: From theorem to the practical algorithms | 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
Vestnik Voronezhskogo Gosudarstvennogo Universiteta. Seriya Fizika, Matematika | 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
Russian Mathematics | 2014-10-21 | Paper |
Some more algorithms for Conway's universal automaton
Acta Universitatis Sapientiae. Informatica | 2014-08-19 | Paper |
Some more on the basis finite automaton
Acta Universitatis Sapientiae, Informatica | 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
Journal of Applied Mathematics and Computing | 2007-10-22 | Paper |
Multiheuristic approach to discrete optimization problems
Cybernetics and Systems Analysis | 2007-07-05 | Paper |
Description of special submonoids of the global supermonoid of a free monoid
Russian Mathematics | 2005-08-26 | Paper |
| scientific article; zbMATH DE number 2095527 (Why is no real title available?) | 2004-08-30 | Paper |
Heuristics in programming of nondeterministic games
Programming and Computer Software | 2003-09-01 | Paper |
| scientific article; zbMATH DE number 1941938 (Why is no real title available?) | 2003-06-29 | Paper |
| scientific article; zbMATH DE number 1779719 (Why is no real title available?) | 2002-11-05 | Paper |
| scientific article; zbMATH DE number 1741789 (Why is no real title available?) | 2002-05-15 | Paper |
Edge-minimization of non-deterministic finite automata
The Korean Journal of Computational & Applied Mathematics | 2002-01-07 | Paper |
| scientific article; zbMATH DE number 1538176 (Why is no real title available?) | 2001-10-30 | Paper |
Commutation in global supermonoid of free monoids
Informatica (Vilnius) | 2001-10-03 | Paper |
A choice of strategy in nondeterministic antagonistic games
Programming and Computer Software | 2001-07-26 | Paper |
Some grammatical structures of programming languages as simple bracketed languages
Informatica (Vilnius) | 2001-06-19 | Paper |
| scientific article; zbMATH DE number 1382843 (Why is no real title available?) | 2000-01-04 | Paper |
| scientific article; zbMATH DE number 1309169 (Why is no real title available?) | 1999-06-28 | Paper |
| scientific article; zbMATH DE number 1257079 (Why is no real title available?) | 1999-05-17 | Paper |
An algorithm for checking the equality of infinite catenations of finite languages
Moscow University Computational Mathematics and Cybernetics | 1999-03-23 | Paper |
| scientific article; zbMATH DE number 1234586 (Why is no real title available?) | 1999-03-14 | Paper |
On an extension of the class of context-free languages
Programming and Computer Software | 1999-01-31 | Paper |
On a classification of sequential context-free languages and grammars
Moscow University Computational Mathematics and Cybernetics | 1995-09-25 | Paper |
THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS
International Journal of Foundations of Computer Science | 1994-04-27 | Paper |
On some corollaries of equivalence conditions of the unambiguous parenthesis grammars
Moscow University Computational Mathematics and Cybernetics | 1992-06-26 | Paper |
