MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Stavros Konstantinidis" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 6 documents found, showing 1 through 6.
ATOM RSS
  • Computing the edit distance of a regular language  
  • by Stavros Konstantinidis — in Proc. of IEEE Information Theory Workshop on Coding and Complexity, Roturoa, New Zealand, Aug. 29
  • …Abstract. The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the words into the other. In this paper we consider the problem of computing the edit distance of a regular langu…
  • Cited by 1 (0 self)Add To MetaCart
  • On a simple method for detecting synchronization errors in coded messages  
  • by Stavros Konstantinidis, Steven Perron, L. Amber Wilcox-o’hearn — 2003 — IEEE Transactions on Information Theory
  • …Abstract—We investigate the problem of designing pairs @ A of words with the property that, if each word of a coded message is prefixed by and suffixed by, the resulting set of coded messages is error detecting with finite delay. We consider (combinatorial) channels permitting any combination of the…
  • Cited by 2 (0 self)Add To MetaCart
  • Error-Detecting Properties of Languages  
  • by Stavros Konstantinidis, Amber O'Hearn — 2002 — Theoretical Computer Science
  • …The language property of error-detection ensures that the communications medium cannot transform a word of the language to another word of the language. In this paper we provide some insights on the notion of error-detection from a language theoretic point of view. We de ne certain error-detecting p…
  • Cited by 1 (1 self)Add To MetaCart
  • Coding properties of DNA languages  
  • by Salah Hussini, Lila Kari, Stavros Konstantinidis — 2002 — In: Theoretical Computer Science
  • …The computation language of a DNA-based system consists of all the words (DNA strands) that can appear in any computation step of the system. In this work we define properties of languages which ensure that the words of such languages will not form undesirable bonds when used in DNA computations…
  • Cited by 11 (4 self)Add To MetaCart
  • and  
  • by Lila Kari, Stavros Konstantinidis, Petr Sos Ík
  • …Communicated by Editor’s name The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA computations. We recall a few existing formalizations of the problem and then define the prope…
  • Add To MetaCart
Help! Showing 1 through 6.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB