Stavros Konstantinidis

According to our database1, Stavros Konstantinidis
  • authored at least 59 papers between 1993 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Embedding Rationally Independent Languages into Maximal Ones.
Journal of Automata, Languages and Combinatorics, 2017

Applications of Transducers in Independent Languages, Word Distances, Codes.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
Channels with Synchronization/Substitution Errors and Computation of Error Control Codes.
CoRR, 2016

Additive methods for genomic signatures.
BMC Bioinformatics, 2016

Implementation of Code Properties via Transducers.
Proceedings of the Implementation and Application of Automata, 2016

Generating error control codes with automata and transducers.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

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

Embedding rationally independent languages into maximal ones.
CoRR, 2015

Symbolic Manipulation of Code Properties.
CoRR, 2015

Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems.
CoRR, 2015

An investigation into inter- and intragenomic variations of graphic genomic signatures.
BMC Bioinformatics, 2015

Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
On the maximality of languages with combined types of code properties.
Theor. Comput. Sci., 2014

An efficient algorithm for computing the edit distance of a regular language via input-altering transducers.
CoRR, 2014

2013
Computing maximal Kleene closures that are embeddable in a given subword-closed language.
Natural Computing, 2013

Deciding the Density Type of a Given Regular Language.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

2012
Formal Descriptions of Code Properties: Decidability, Complexity, Implementation.
Int. J. Found. Comput. Sci., 2012

2011
Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language.
Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

2010
f-Words and Binary Solid Codes.
Journal of Automata, Languages and Combinatorics, 2010

On implementing recognizable transductions.
Int. J. Comput. Math., 2010

Computing Maximal Error-detecting Capabilities and Distances of Regular Languages.
Fundam. Inform., 2010

2009
State-complexity hierarchies of uniform languages of alphabet-size length.
Theor. Comput. Sci., 2009

On the definition of stochastic lambda-transducers.
Int. J. Comput. Math., 2009

2008
Maximal Error-Detecting Capabilities of Formal Languages.
Journal of Automata, Languages and Combinatorics, 2008

State Complexity of the Subword Closure Operation with Applications to DNA Coding.
Int. J. Found. Comput. Sci., 2008

State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
Computing the edit distance of a regular language.
Inf. Comput., 2007

Fuzzification of Rational and Recognizable Sets.
Fundam. Inform., 2007

Representation and uniformization of algebraic transductions.
Acta Inf., 2007

DNA Coding Using the Subword Closure Operation.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006
(Near-)inverses of sequences.
Int. J. Comput. Math., 2006

A Formal Language Analysis of DNA Hairpin Structures.
Fundam. Inform., 2006

2005
On properties of bond-free DNA languages.
Theor. Comput. Sci., 2005

Language equations, maximality and error-detection.
J. Comput. Syst. Sci., 2005

Bond-free languages: formalizations, maximality and construction methods.
Int. J. Found. Comput. Sci., 2005

Operations on trajectories with applications to coding and bioinformatics.
Int. J. Found. Comput. Sci., 2005

Hairpin Structures in DNA Words.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

On Hairpin-Free Words and Languages.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Descriptional Complexity of Error/Edit Systems.
Journal of Automata, Languages and Combinatorics, 2004

Asymptotically Optimal Low-Cost Solid Codes.
Journal of Automata, Languages and Combinatorics, 2004

Substitutions, Trajectories and Noisy Channels.
Proceedings of the Implementation and Application of Automata, 2004

Preventing Undesirable Bonds Between DNA Codewords.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Bond-Free Languages: Formalizations, Maximality and Construction Methods.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Substitution on Trajectories.
Proceedings of the Theory Is Forever, 2004

2003
On a simple method for detecting synchronization errors in coded messages.
IEEE Trans. Information Theory, 2003

Coding properties of DNA languages.
Theor. Comput. Sci., 2003

Sticky-free and overhang-free DNA languages.
Acta Inf., 2003

2002
Error-detecting properties of languages.
Theor. Comput. Sci., 2002

Error-Correction, and Finite-Delay Decodability.
J. UCS, 2002

Descriptional Complexity of Error/Edit Systems.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001
Relationships between different error-correcting capabilities of a code.
IEEE Trans. Information Theory, 2001

Maximal Solid Codes.
Journal of Automata, Languages and Combinatorics, 2001

An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types.
Inf. Comput., 2001

Coding Properties of DNA Languages.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

2000
Error-Detecting Properties of Languages.
Proceedings of the International Colloquium on Words, 2000

1999
Structural Analysis of Error-Correcting Codes for Discrete Channels That Involve Combinations of Three Basic Error Types.
IEEE Trans. Information Theory, 1999

1995
Error Corrections for Channels with Substitutions, Insertions, and Deletions.
Proceedings of the Information Theory and Applications II, 1995

Variable-Length Codes for Error Correction.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1993
The Hierarchy of Codes.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993


  Loading...