2008 |
33 | EE | Cezar Câmpeanu,
Stavros Konstantinidis:
State Complexity of the Subword Closure Operation with Applications to DNA Coding.
Int. J. Found. Comput. Sci. 19(5): 1099-1112 (2008) |
32 | | Stavros Konstantinidis,
Pedro V. Silva:
Maximal Error-Detecting Capabilities of Formal Languages.
Journal of Automata, Languages and Combinatorics 13(1): 55-71 (2008) |
2007 |
31 | EE | Bo Cui,
Stavros Konstantinidis:
DNA Coding Using the Subword Closure Operation.
DNA 2007: 284-289 |
30 | EE | Stavros Konstantinidis,
Nicolae Santean,
Sheng Yu:
Representation and uniformization of algebraic transductions.
Acta Inf. 43(6): 395-417 (2007) |
29 | EE | Stavros Konstantinidis,
Nicolae Santean,
Sheng Yu:
Fuzzification of Rational and Recognizable Sets.
Fundam. Inform. 76(4): 413-447 (2007) |
28 | EE | Stavros Konstantinidis:
Computing the edit distance of a regular language.
Inf. Comput. 205(9): 1307-1316 (2007) |
2006 |
27 | EE | Lila Kari,
Elena Losseva,
Stavros Konstantinidis,
Petr Sosík,
Gabriel Thierrin:
A Formal Language Analysis of DNA Hairpin Structures.
Fundam. Inform. 71(4): 453-475 (2006) |
26 | EE | Helmut Jürgensen,
Stavros Konstantinidis:
(Near-)inverses of sequences.
Int. J. Comput. Math. 83(2): 203-222 (2006) |
2005 |
25 | EE | Lila Kari,
Stavros Konstantinidis,
Elena Losseva,
Petr Sosík,
Gabriel Thierrin:
Hairpin Structures in DNA Words.
DNA 2005: 158-170 |
24 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík,
Gabriel Thierrin:
On Hairpin-Free Words and Languages.
Developments in Language Theory 2005: 296-307 |
23 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Operations on trajectories with applications to coding and bioinformatics.
Int. J. Found. Comput. Sci. 16(3): 531-546 (2005) |
22 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Bond-free languages: formalizations, maximality and construction methods.
Int. J. Found. Comput. Sci. 16(5): 1039-1070 (2005) |
21 | EE | Lila Kari,
Stavros Konstantinidis:
Language equations, maximality and error-detection.
J. Comput. Syst. Sci. 70(1): 157-178 (2005) |
20 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
On properties of bond-free DNA languages.
Theor. Comput. Sci. 334(1-3): 131-159 (2005) |
2004 |
19 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Substitutions, Trajectories and Noisy Channels.
CIAA 2004: 202-212 |
18 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Bond-Free Languages: Formalizations, Maximality and Construction Methods.
DNA 2004: 169-181 |
17 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Preventing Undesirable Bonds Between DNA Codewords.
DNA 2004: 182-191 |
16 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Substitution on Trajectories.
Theory Is Forever 2004: 145-158 |
15 | | Helmut Jürgensen,
Stavros Konstantinidis,
Nguyen Huong Lam:
Asymptotically Optimal Low-Cost Solid Codes.
Journal of Automata, Languages and Combinatorics 9(1): 81-102 (2004) |
14 | | Lila Kari,
Stavros Konstantinidis:
Descriptional Complexity of Error/Edit Systems.
Journal of Automata, Languages and Combinatorics 9(2/3): 293-309 (2004) |
2003 |
13 | EE | Lila Kari,
Stavros Konstantinidis,
Elena Losseva,
Geoff Wozniak:
Sticky-free and overhang-free DNA languages.
Acta Inf. 40(2): 119-157 (2003) |
12 | | Stavros Konstantinidis,
Steven Perron,
L. Amber Wilcox-O'Hearn:
On a simple method for detecting synchronization errors in coded messages.
IEEE Transactions on Information Theory 49(5): 1355-1363 (2003) |
11 | | Salah Hussini,
Lila Kari,
Stavros Konstantinidis:
Coding properties of DNA languages.
Theor. Comput. Sci. 290(3): 1557-1579 (2003) |
2002 |
10 | EE | Stavros Konstantinidis:
Error-Correction, and Finite-Delay Decodability.
J. UCS 8(2): 278-291 (2002) |
9 | EE | Stavros Konstantinidis,
Amber O'Hearn:
Error-detecting properties of languages.
Theor. Comput. Sci. 276(1-2): 355-375 (2002) |
2001 |
8 | EE | Salah Hussini,
Lila Kari,
Stavros Konstantinidis:
Coding Properties of DNA Languages.
DNA 2001: 57-69 |
7 | | Stavros Konstantinidis:
Relationships between different error-correcting capabilities of a code.
IEEE Transactions on Information Theory 47(5): 2065-2069 (2001) |
6 | | Stavros Konstantinidis:
An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types.
Inf. Comput. 167(2): 120-131 (2001) |
5 | | Helmut Jürgensen,
Masashi Katsura,
Stavros Konstantinidis:
Maximal Solid Codes.
Journal of Automata, Languages and Combinatorics 6(1): 25-50 (2001) |
1999 |
4 | | Stavros Konstantinidis:
Structural Analysis of Error-Correcting Codes for Discrete Channels That Involve Combinations of Three Basic Error Types.
IEEE Transactions on Information Theory 45(1): 60-77 (1999) |
1995 |
3 | | Helmut Jürgensen,
Stavros Konstantinidis:
Variable-Length Codes for Error Correction.
ICALP 1995: 581-592 |
2 | | Helmut Jürgensen,
Stavros Konstantinidis:
Error Corrections for Channels with Substitutions, Insertions, and Deletions.
Information Theory and Applications 1995: 149-163 |
1993 |
1 | | Helmut Jürgensen,
Stavros Konstantinidis:
The Hierarchy of Codes.
FCT 1993: 50-68 |