The Distinguishing String Selection Problem

In this paper we consider an approach to solve the distinguishing string selection problem. This approach is based on constructing logical models for the problem.

[1]  Vladimir Yu. Popov,et al.  The set of parameterized k-covers problem , 2012, Theor. Comput. Sci..

[2]  Andrey Sheka,et al.  Localization on Discrete Grid Graphs , 2012 .

[3]  Anna Gorbenko,et al.  Self-Learning Algorithm for Visual Recognition and Object Categorization for Autonomous Mobile Robots , 2012 .

[4]  Ming Li,et al.  Some string problems in computational biology , 2000 .

[5]  The property of having independent basis in semigroup varieties , 2005 .

[6]  Anna Gorbenko,et al.  On the Optimal Reconfiguration Planning for Modular Self-Reconfigurable DNA Nanomechanical Robots , 2012 .

[7]  Vladimir Yu. Popov,et al.  Programming for modular reconfigurable robots , 2012, Programming and Computer Software.

[8]  Anna Gorbenko,et al.  Task-resource scheduling problem , 2012, International Journal of Automation and Computing.

[9]  V. Y. Popov,et al.  Multiple genome rearrangement by swaps and by element duplications , 2007, Theor. Comput. Sci..

[10]  Anna Gorbenko,et al.  Element Duplication Centre Problem and Railroad Tracks Recognition , 2012 .

[11]  The Word Problem for Relatively Free Semigroups , 2006 .

[12]  Decidability boundaries for some classes of nilpotent and solvable groups , 2000 .

[13]  V. Popov.  Equational Theories for Classes of Finite Semigroups , 2001 .

[14]  On connection between the word problem and decidability of the equational theory , 2000 .

[15]  Decidability of Equational Theories of Coverings of Semigroup Varieties , 2001 .

[16]  Bin Ma,et al.  Distinguishing string selection problems , 2003, SODA '99.

[17]  On the Finite Base Property for Semigroup Varieties , 2002 .

[18]  On equational theories of varieties of anticommutative rings , 1999 .

[19]  V. Y. Popov.  The approximate period problem for DNA alphabet , 2003, Theor. Comput. Sci..

[20]  A. Gorbenko,et al.  The Longest Common Subsequence Problem , 2012 .

[21]  V. Popov,et al.  On positive and critical theories of some classes of rings , 2000 .

[22]  V. Popov.  Computational complexity of problems related to DNA sequencing by hybridization , 2005 .

[23]  V. Popov.  On Complexity of the Word Problem for Finitely Presented Commutative Semigroups , 2002 .

[25]  A Ring Variety without an Independent Basis , 2001 .