Stavros Konstantinidis

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