Next: Papers in proceedings of Up: RESEARCH ACTIVITIES of Stavros


Papers in refereed journals

  1. [DuKo12] K. Dudzinski, S. Konstantinidis: Formal descriptions of code properties: decidability, complexity, implementation. International Journal of Foundations of Computer Science 23:1 (2012), 67--85. pdf file
  2. [KoYo10] S. Konstantinidis, J. Young: f-Words and binary solid codes. Journal of Automata, Languages and Combinatorics 15:3/4 (2010), 269-283. pdf file
  3. [KoSi10] S. Konstantinidis, P. Silva: Computing maximal error-detecting capabilities and distances of regular languages. Fundamenta Informaticae 101:4 (2010), 257-270.
  4. [KSY10] S. Konstantinidis, N. Santean, S. Yu: On implementing recognizable transductions. Intern. Journal of Computer Mathematics 87:2 (2010), 260–277.
  5. [BrKo09] J. Brzozowski, S. Konstantinidis: State-complexity hierarchies of uniform languages of alphabet-size length. Theoretical Computer Science 410:35 (2009), 3223-3235.
  6. [KoSa09] S. Konstantinidis, N. Santean: On the definition of stochastic λ-Transducers. Intern. Journal of Computer Mathematics 86:8 (2009), 1300–1310.
  7. [CaKo08] C. Campeanu, S. Konstantinidis: State complexity of the subword closure operation with applications to DNA coding. International Journal of Foundations of Computer Science 19:5 (2008), 1099--1112. pdf file
  8. [KoSi08] S. Konstantinidis, P. Silva: Maximal error-detecting capabilities of formal languages. Journal of Automata, Languages and Combinatorics 13:1 (2008), 55-71. pdf file
  9. [Kon07] S. Konstantinidis: Computing the edit distance of a regular language. Information and Computation 205 (2007), 1307-1316. (near final version ps file)
  10. [KSY07b] S. Konstantinidis, N. Santean, S. Yu: Fuzzification of Rational and Recognizable Sets. Fundamenta Informaticae 76:4 (2007), 413-447.
  11. [KSY07] S. Konstantinidis, N. Santean, S. Yu: Representation and uniformization of algebraic transductions. Acta Informatica 43:6 (2007), 395-417
  12. [KKLSTfi] L. Kari, S. Konstantinidis, E. Losseva, P. Sosík, G. Thierrin: A Formal Language Analysis of DNA Hairpin Structures. Fundamenta Informaticae 71 (2006), 453--475.
  13. [JuKo06ijcm] H. Jürgensen, S. Konstantinidis: (Near-)inverses of Sequences. Intern. Journal of Computer Mathematics 83:2 (2006), 203–222.
  14. [KKSijfcs] L. Kari, S. Konstantinidis, P. Sosík: Bond-free Languages: Formalizations, Maximality and Construction Methods. International Journal of Foundations of Computer Science 16 (2005), 1039--1070. pdf file
  15. [KKS05ijfcs] L. Kari, S. Konstantinidis, P. Sosík: Operations on Trajectories with Applications to Coding and Bioinformatics. International Journal of Foundations of Computer Science 16 (2005), 531-546. ps file
  16. [KKS05tcs] L. Kari, S. Konstantinidis, P. Sosík: On properties of bond-free DNA languages. Theoretical Computer Science 334 (2005), 131-159. ps file
  17. [KaKo05jcss] L. Kari, S. Konstantinidis: Language Equations, Maximality and Error-detection. Journal of Computer and System Sciences 70 (2005), 157-178. pdf file
  18. [KaKo04jalc] L. Kari, S. Konstantinidis: Descriptional Complexity of Error/Edit Systems. Journal of Automata, Languages and Combinatorics 9:2/3 (2004), 293–309.
  19. [JKL04jalc] H. Jürgensen, S. Konstantinidis, N. H. Lâm: Asymptotically optimal low-cost solid codes. Journal of Automata, Languages and Combinatorics 9:1 (2004), 81–102.
  20. [KPW03tit] S. Konstantinidis, S. Perron*, L. A. Wilcox-O'Hearn*: On a Simple Method for Detecting Synchronization Errors in Coded Messages. IEEE Transactions on Information Theory 49 (2003), 1355-1363. pdf file
  21. [KKLW03ai] L. Kari, S. Konstantinidis, E. Losseva, G. Wozniak: Sticky-Free and Overhang-Free DNA Languages. Acta Informatica 40 (2003), 119-157.
  22. [HKK03tcs] S. Hussini*, L. Kari, S. Konstantinidis: Coding Properties of DNA Languages. Theoretical Computer Science 290 (2003), 1557-1579.
  23. [KaOH02tcs] S. Konstantinidis, A. O'Hearn*: Error-Detecting Properties of Languages. Theoretical Computer Science 276 (2002), 355-375.
  24. [Kon02jucs] S. Konstantinidis: Transducers and the Properties of Error-Detection, Error-Correction and Finite-Delay Decodability. Journal Of Universal Computer Science 8 (2002), 278-291. pdf file
  25. [Kon01tit] S. Konstantinidis: Relationships between Different Error-Correcting Capabilities of a Code. IEEE Transactions on Information Theory 47 (2001), 2065-2069.
  26. [Kon01ic] S. Konstantinidis: An Algebra of Discrete Channels that Involve Combinations of Three Basic Error Types. Information and Computation 167 (2001), 120-131.
  27. [JKK01jalc] H. Jürgensen, M. Katsura, S. Konstantinidis: Maximal Solid Codes. Journal of Automata, Languages and Combinatorics 6 (2001), 25-50.
  28. [Kon99tit] S. Konstantinidis: Structural Analysis of Error-Correcting Codes for Discrete Channels that Involve Combinations of Three Basic Error Types. IEEE Transactions on Information Theory 45 (1999), 60-77.


Next: Papers in proceedings of Up: RESEARCH ACTIVITIES of Stavros