The Hierarchy of Codes. - Helmut Jürgensen; Stavros Konstantinidis (FCT, 1993)

Variable-Length Codes for Error Correction. - Helmut Jürgensen; Stavros Konstantinidis (ICALP, 1995)

Error Corrections for Channels with Substitutions, Insertions, and Deletions. - Helmut Jürgensen; Stavros Konstantinidis (Information Theory and Applications, 1995)

Codes1. - Helmut Jürgensen; Stavros Konstantinidis (Handbook of Formal Languages (1), 1997)

Structural Analysis of Error-Correcting Codes for Discrete Channels That Involve Combinations of Three Basic Error Types. - Stavros Konstantinidis (IEEE Trans. Inf. Theory, 1999)

Error-Detecting Properties of Languages. - Stavros Konstantinidis (Words, Languages & Combinatorics, 2000)

An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types. - Stavros Konstantinidis (Inf. Comput., 2001)

Maximal Solid Codes. - Helmut Jürgensen; Masashi Katsura; Stavros Konstantinidis (J. Autom. Lang. Comb., 2001)

Relationships between different error-correcting capabilities of a code. - Stavros Konstantinidis (IEEE Trans. Inf. Theory, 2001)

Error-Correction, and Finite-Delay Decodability. - Stavros Konstantinidis (J. Univers. Comput. Sci., 2002)

Error-detecting properties of languages. - Stavros Konstantinidis; Amber O'Hearn (Theor. Comput. Sci., 2002)

Sticky-free and overhang-free DNA languages. - Lila Kari; Stavros Konstantinidis; Elena Losseva; Geoff Wozniak (Acta Informatica, 2003)

Coding properties of DNA languages. - Salah Hussini; Lila Kari; Stavros Konstantinidis (Theor. Comput. Sci., 2003)

On a simple method for detecting synchronization errors in coded messages. - Stavros Konstantinidis; Steven Perron; L. Amber Wilcox-O'Hearn (IEEE Trans. Inf. Theory, 2003)

Substitution on Trajectories. - Lila Kari; Stavros Konstantinidis; Petr Sosík (Theory Is Forever, 2004)

Preventing Undesirable Bonds Between DNA Codewords. - Lila Kari; Stavros Konstantinidis; Petr Sosík (DNA, 2004)

Substitutions, Trajectories and Noisy Channels. - Lila Kari; Stavros Konstantinidis; Petr Sosík (CIAA, 2004)

Asymptotically Optimal Low-Cost Solid Codes. - Helmut Jürgensen; Stavros Konstantinidis; Nguyen Huong Lam (J. Autom. Lang. Comb., 2004)

Descriptional Complexity of Error/Edit Systems. - Lila Kari; Stavros Konstantinidis (J. Autom. Lang. Comb., 2004)

On Hairpin-Free Words and Languages. - Lila Kari; Stavros Konstantinidis; Petr Sosík; Gabriel Thierrin (Developments in Language Theory, 2005)

Hairpin Structures in DNA Words. - Lila Kari; Stavros Konstantinidis; Elena Losseva; Petr Sosík; Gabriel Thierrin (DNA, 2005)

Computing the Levenshtein distance of a regular language. - Stavros Konstantinidis (ITW, 2005)

Operations on trajectories with applications to coding and bioinformatics. - Lila Kari; Stavros Konstantinidis; Petr Sosík (Int. J. Found. Comput. Sci., 2005)

Bond-free languages: formalizations, maximality and construction methods. - Lila Kari; Stavros Konstantinidis; Petr Sosík (Int. J. Found. Comput. Sci., 2005)

Language equations, maximality and error-detection. - Lila Kari; Stavros Konstantinidis (J. Comput. Syst. Sci., 2005)

On properties of bond-free DNA languages. - Lila Kari; Stavros Konstantinidis; Petr Sosík (Theor. Comput. Sci., 2005)

A Formal Language Analysis of DNA Hairpin Structures. - Lila Kari; Elena Losseva; Stavros Konstantinidis; Petr Sosík; Gabriel Thierrin (Fundam. Informaticae, 2006)

(Near-)inverses of sequences. - Helmut Jürgensen; Stavros Konstantinidis (Int. J. Comput. Math., 2006)

DNA Coding Using the Subword Closure Operation. - Bo Cui; Stavros Konstantinidis (DNA, 2007)

Representation and uniformization of algebraic transductions. - Stavros Konstantinidis; Nicolae Santean; Sheng Yu 001 (Acta Informatica, 2007)

Fuzzification of Rational and Recognizable Sets. - Stavros Konstantinidis; Nicolae Santean; Sheng Yu 001 (Fundam. Informaticae, 2007)

Computing the edit distance of a regular language. - Stavros Konstantinidis (Inf. Comput., 2007)

State Complexity of the Subword Closure Operation with Applications to DNA Coding. - Cezar Câmpeanu; Stavros Konstantinidis (Int. J. Found. Comput. Sci., 2008)

Maximal Error-Detecting Capabilities of Formal Languages. - Stavros Konstantinidis; Pedro V. Silva (J. Autom. Lang. Comb., 2008)

On the definition of stochastic lambda-transducers. - Stavros Konstantinidis; Nicolae Santean (Int. J. Comput. Math., 2009)

State-complexity hierarchies of uniform languages of alphabet-size length. - Janusz A. Brzozowski; Stavros Konstantinidis (Theor. Comput. Sci., 2009)

Computing Maximal Error-detecting Capabilities and Distances of Regular Languages. - Stavros Konstantinidis; Pedro V. Silva (Fundam. Informaticae, 2010)

On implementing recognizable transductions. - Stavros Konstantinidis; Nicolae Santean; Sheng Yu 001 (Int. J. Comput. Math., 2010)

f-Words and Binary Solid Codes. - Stavros Konstantinidis; Joshua Young (J. Autom. Lang. Comb., 2010)

Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language. - Stavros Konstantinidis; Nicolae Santean (DNA, 2011)

Formal Descriptions of Code Properties: Decidability, Complexity, Implementation. - Krystian Dudzinski; Stavros Konstantinidis (Int. J. Found. Comput. Sci., 2012)

Deciding the Density Type of a Given Regular Language. - Stavros Konstantinidis; Joshua Young (Stringology, 2013)

Computing maximal Kleene closures that are embeddable in a given subword-closed language. - Stavros Konstantinidis; Nicolae Santean (Nat. Comput., 2013)

An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. - Lila Kari; Stavros Konstantinidis; Steffen Kopecki; Meng Yang 010 (CoRR, 2014)

On the maximality of languages with combined types of code properties. - Lila Kari; Stavros Konstantinidis; Steffen Kopecki (Theor. Comput. Sci., 2014)

An investigation into inter- and intragenomic variations of graphic genomic signatures. - Rallis Karamichalis; Lila Kari; Stavros Konstantinidis; Steffen Kopecki (BMC Bioinform., 2015)

Implementation and Application of Automata (CIAA 2013). - Stavros Konstantinidis (Theor. Comput. Sci., 2015)

Generating error control codes with automata and transducers. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (NCMA, 2016)

Implementation of Code Properties via Transducers. - Stavros Konstantinidis; Casey Meijer; Nelma Moreira; Rogério Reis (CIAA, 2016)

Additive methods for genomic signatures. - Rallis Karamichalis; Lila Kari; Stavros Konstantinidis; Steffen Kopecki; Stephen Solis-Reyes (BMC Bioinform., 2016)

Channels with Synchronization/Substitution Errors and Computation of Error Control Codes. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (CoRR, 2016)

Applications of Transducers in Independent Languages, Word Distances, Codes. - Stavros Konstantinidis (DCFS, 2017)

Report on DCFS 2017. - Stavros Konstantinidis (Bull. EATCS, 2017)

Embedding Rationally Independent Languages into Maximal Ones. - Stavros Konstantinidis; Mitja Mastnak (J. Autom. Lang. Comb., 2017)

Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers. - Lila Kari; Stavros Konstantinidis; Steffen Kopecki; Meng Yang 010 (Algorithms, 2018)

Transducer descriptions of DNA code properties and undecidability of antimorphic problems. - Lila Kari; Stavros Konstantinidis; Steffen Kopecki (Inf. Comput., 2018)

Randomized generation of error control codes with automata and transducers. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (RAIRO Theor. Informatics Appl., 2018)

Symbolic Manipulation of Code Properties. - Stavros Konstantinidis; Casey Meijer; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2018)

Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. - Stavros Konstantinidis; Mitja Mastnak; Juraj Sebej (CIAA, 2019)

Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels. - Stavros Konstantinidis; Nelma Moreira; João Pires 002; Rogério Reis (CIAA, 2019)

Special section on Descriptional Complexity of Formal Systems. - Stavros Konstantinidis; Giovanni Pighizzini (Theor. Comput. Sci., 2019)

Theoretical and Implementational Aspects of the Formal Language Server (LaSer). - Stavros Konstantinidis (CiE, 2020)

On the Average State Complexity of Partial Derivative Transducers. - Stavros Konstantinidis; António Machiavelo; Nelma Moreira; Rogério Reis (SOFSEM, 2020)

Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis; Joshua Young (Int. J. Found. Comput. Sci., 2020)

Every Regular Bifix Code is a Finite Union of Regular Infix Codes. - Stavros Konstantinidis (J. Autom. Lang. Comb., 2020)

Partial Derivative Automaton by Compressing Regular Expressions. - Stavros Konstantinidis; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2021)

On the size of partial derivatives and the word membership problem. - Stavros Konstantinidis; António Machiavelo; Nelma Moreira; Rogério Reis (Acta Informatica, 2021)

Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem. - Stavros Konstantinidis; Mitja Mastnak; Juraj Sebej (Int. J. Found. Comput. Sci., 2021)

Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (Theor. Comput. Sci., 2021)

Approximate NFA Universality Motivated by Information Theory. - Stavros Konstantinidis; Mitja Mastnak; Nelma Moreira; Rogério Reis (DCFS, 2022)

Descriptional Complexity of Formal Systems (DCFS 2019). - Galina Jirásková; Stavros Konstantinidis (Inf. Comput., 2022)

On the average complexity of partial derivative transducers. - Stavros Konstantinidis; António Machiavelo; Nelma Moreira; Rogério Reis (Theor. Comput. Sci., 2023)

Approximate NFA universality and related problems motivated by information theory. - Stavros Konstantinidis; Mitja Mastnak; Nelma Moreira; Rogério Reis (Theor. Comput. Sci., 2023)

Improved Randomized Approximation of Hard Universality and Emptiness Problems. - Pantelis Andreou; Stavros Konstantinidis; Taylor J. Smith (CoRR, 2024)

On the difference set of two transductions. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis; Juraj Sebej (Theor. Comput. Sci., 2024)

Language Quotients Revisited. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (Int. J. Found. Comput. Sci., 2025)