Stavros Konstantinidis

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 31

Top Topics

Efficient Algorithms For Computing

Regular Expressions

Finite Automata

Top Venues

Theor. Comput. Sci.

Publications

Pantelis Andreou, Stavros Konstantinidis, Taylor J. Smith
Improved Randomized Approximation of Hard Universality and Emptiness Problems. CoRR (2024)
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
On the average complexity of partial derivative transducers. Theor. Comput. Sci. 956 (2023)
Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis
Approximate NFA universality and related problems motivated by information theory. Theor. Comput. Sci. 972 (2023)
Galina Jirásková, Stavros Konstantinidis
Descriptional Complexity of Formal Systems (DCFS 2019). Inf. Comput. 284 (2022)
Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis
Approximate NFA Universality Motivated by Information Theory. DCFS (2022)
Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis
Approximate NFA Universality and Related Problems Motivated by Information Theory. CoRR (2022)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. Theor. Comput. Sci. 870 (2021)
Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej
Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem. Int. J. Found. Comput. Sci. 32 (5) (2021)
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
Partial Derivative Automaton by Compressing Regular Expressions. DCFS (2021)
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
On the size of partial derivatives and the word membership problem. Acta Informatica 58 (4) (2021)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels. Int. J. Found. Comput. Sci. 31 (8) (2020)
Stavros Konstantinidis
Theoretical and Implementational Aspects of the Formal Language Server (LaSer). CiE (2020)
Stavros Konstantinidis
Every Regular Bifix Code is a Finite Union of Regular Infix Codes. J. Autom. Lang. Comb. 25 (1) (2020)
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
On the Average State Complexity of Partial Derivative Transducers. SOFSEM (2020)
Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. CIAA (2019)
Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. CoRR (2019)
Stavros Konstantinidis, Giovanni Pighizzini
Special section on Descriptional Complexity of Formal Systems. Theor. Comput. Sci. 798 (2019)
Stavros Konstantinidis, Nelma Moreira, João Pires, Rogério Reis
Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels. CIAA (2019)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young
Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels. CIAA (2018)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang
Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers. Algorithms 11 (11) (2018)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
Transducer descriptions of DNA code properties and undecidability of antimorphic problems. Inf. Comput. 259 (2) (2018)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
Randomized generation of error control codes with automata and transducers. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
Symbolic Manipulation of Code Properties. J. Autom. Lang. Comb. 23 (1-3) (2018)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young
Regular Expressions and Transducers over Alphabet-invariant and User-defined Labels. CoRR (2018)
Stavros Konstantinidis
Report on DCFS 2017. Bull. EATCS 123 (2017)
Stavros Konstantinidis
Applications of Transducers in Independent Languages, Word Distances, Codes. DCFS (2017)
Stavros Konstantinidis, Mitja Mastnak
Embedding Rationally Independent Languages into Maximal Ones. J. Autom. Lang. Comb. 21 (4) (2017)
Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
Implementation of Code Properties via Transducers. CIAA (2016)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
Channels with Synchronization/Substitution Errors and Computation of Error Control Codes. CoRR (2016)
Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Stephen Solis-Reyes
Additive methods for genomic signatures. BMC Bioinform. 17 (2016)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
Generating error control codes with automata and transducers. NCMA (2016)
Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
Symbolic Manipulation of Code Properties. CoRR (2015)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. CoRR (2015)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. DCFS (2015)
Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki
An investigation into inter- and intragenomic variations of graphic genomic signatures. BMC Bioinform. 16 (2015)
Stavros Konstantinidis
Implementation and Application of Automata (CIAA 2013). Theor. Comput. Sci. 578 (2015)
Stavros Konstantinidis, Mitja Mastnak
Embedding rationally independent languages into maximal ones. CoRR (2015)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang
An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. CoRR (2014)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
On the maximality of languages with combined types of code properties. Theor. Comput. Sci. 550 (2014)
Stavros Konstantinidis, Joshua Young
Deciding the Density Type of a Given Regular Language. Stringology (2013)
Stavros Konstantinidis, Nicolae Santean
Computing maximal Kleene closures that are embeddable in a given subword-closed language. Nat. Comput. 12 (2) (2013)
Krystian Dudzinski, Stavros Konstantinidis
Formal Descriptions of Code Properties: Decidability, Complexity, Implementation. Int. J. Found. Comput. Sci. 23 (1) (2012)
Stavros Konstantinidis, Nicolae Santean
Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language. DNA (2011)
Stavros Konstantinidis, Pedro V. Silva
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages. Fundam. Informaticae 101 (4) (2010)
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
On implementing recognizable transductions. Int. J. Comput. Math. 87 (2) (2010)
Stavros Konstantinidis, Joshua Young
f-Words and Binary Solid Codes. J. Autom. Lang. Comb. 15 (3/4) (2010)
Janusz A. Brzozowski, Stavros Konstantinidis
State-complexity hierarchies of uniform languages of alphabet-size length. Theor. Comput. Sci. 410 (35) (2009)
Stavros Konstantinidis, Nicolae Santean
On the definition of stochastic lambda-transducers. Int. J. Comput. Math. 86 (8) (2009)
Stavros Konstantinidis, Pedro V. Silva
Maximal Error-Detecting Capabilities of Formal Languages. J. Autom. Lang. Comb. 13 (1) (2008)
Cezar Câmpeanu, Stavros Konstantinidis
State Complexity of the Subword Closure Operation with Applications to DNA Coding. Int. J. Found. Comput. Sci. 19 (5) (2008)
Janusz A. Brzozowski, Stavros Konstantinidis
State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length. DCFS (2008)
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
Fuzzification of Rational and Recognizable Sets. Fundam. Informaticae 76 (4) (2007)
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
Representation and uniformization of algebraic transductions. Acta Informatica 43 (6) (2007)
Bo Cui, Stavros Konstantinidis
DNA Coding Using the Subword Closure Operation. DNA (2007)
Stavros Konstantinidis
Computing the edit distance of a regular language. Inf. Comput. 205 (9) (2007)
Helmut Jürgensen, Stavros Konstantinidis
(Near-)inverses of sequences. Int. J. Comput. Math. 83 (2) (2006)
Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin
A Formal Language Analysis of DNA Hairpin Structures. Fundam. Informaticae 71 (4) (2006)
Stavros Konstantinidis
Computing the Levenshtein distance of a regular language. ITW (2005)
Lila Kari, Stavros Konstantinidis, Petr Sosík
Operations on trajectories with applications to coding and bioinformatics. Int. J. Found. Comput. Sci. 16 (3) (2005)
Lila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin
On Hairpin-Free Words and Languages. Developments in Language Theory (2005)
Lila Kari, Stavros Konstantinidis, Petr Sosík
Bond-free languages: formalizations, maximality and construction methods. Int. J. Found. Comput. Sci. 16 (5) (2005)
Lila Kari, Stavros Konstantinidis
Language equations, maximality and error-detection. J. Comput. Syst. Sci. 70 (1) (2005)
Lila Kari, Stavros Konstantinidis, Petr Sosík
On properties of bond-free DNA languages. Theor. Comput. Sci. 334 (1-3) (2005)
Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin
Hairpin Structures in DNA Words. DNA (2005)
Lila Kari, Stavros Konstantinidis
Descriptional Complexity of Error/Edit Systems. J. Autom. Lang. Comb. 9 (2/3) (2004)
Lila Kari, Stavros Konstantinidis, Petr Sosík
Bond-Free Languages: Formalizations, Maximality and Construction Methods. DNA (2004)
Lila Kari, Stavros Konstantinidis, Petr Sosík
Preventing Undesirable Bonds Between DNA Codewords. DNA (2004)
Helmut Jürgensen, Stavros Konstantinidis, Nguyen Huong Lam
Asymptotically Optimal Low-Cost Solid Codes. J. Autom. Lang. Comb. 9 (1) (2004)
Lila Kari, Stavros Konstantinidis, Petr Sosík
Substitutions, Trajectories and Noisy Channels. CIAA (2004)
Lila Kari, Stavros Konstantinidis, Petr Sosík
Substitution on Trajectories. Theory Is Forever (2004)
Salah Hussini, Lila Kari, Stavros Konstantinidis
Coding properties of DNA languages. Theor. Comput. Sci. 290 (3) (2003)
Stavros Konstantinidis, Steven Perron, L. Amber Wilcox-O'Hearn
On a simple method for detecting synchronization errors in coded messages. IEEE Trans. Inf. Theory 49 (5) (2003)
Lila Kari, Stavros Konstantinidis, Elena Losseva, Geoff Wozniak
Sticky-free and overhang-free DNA languages. Acta Informatica 40 (2) (2003)
Stavros Konstantinidis
Error-Correction, and Finite-Delay Decodability. J. Univers. Comput. Sci. 8 (2) (2002)
Lila Kari, Stavros Konstantinidis
Descriptional Complexity of Error/Edit Systems. DCFS (2002)
Stavros Konstantinidis, Amber O'Hearn
Error-detecting properties of languages. Theor. Comput. Sci. 276 (1-2) (2002)
Salah Hussini, Lila Kari, Stavros Konstantinidis
Coding Properties of DNA Languages. DNA (2001)
Stavros Konstantinidis
Relationships between different error-correcting capabilities of a code. IEEE Trans. Inf. Theory 47 (5) (2001)
Helmut Jürgensen, Masashi Katsura, Stavros Konstantinidis
Maximal Solid Codes. J. Autom. Lang. Comb. 6 (1) (2001)
Stavros Konstantinidis
An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types. Inf. Comput. 167 (2) (2001)
Stavros Konstantinidis
Error-Detecting Properties of Languages. Words, Languages & Combinatorics (2000)
Stavros Konstantinidis
Structural Analysis of Error-Correcting Codes for Discrete Channels That Involve Combinations of Three Basic Error Types. IEEE Trans. Inf. Theory 45 (1) (1999)
Helmut Jürgensen, Stavros Konstantinidis
Error Corrections for Channels with Substitutions, Insertions, and Deletions. Information Theory and Applications (1995)
Helmut Jürgensen, Stavros Konstantinidis
Variable-Length Codes for Error Correction. ICALP (1995)
Helmut Jürgensen, Stavros Konstantinidis
The Hierarchy of Codes. FCT (1993)