Stavros Konstantinidis

Taylor J. Smith

CoRR, 2024

2023

Approximate NFA universality and related problems motivated by information theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

On the average complexity of partial derivative transducers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., May, 2023

2022

Descriptional Complexity of Formal Systems (DCFS 2019).

[BibT_eX]

[DOI]

Galina Jirásková

Inf. Comput., 2022

Approximate NFA Universality Motivated by Information Theory.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021

Partial derivatives of regular expressions over alphabet-invariant and user-defined labels.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem.

[BibT_eX]

[DOI]

Juraj Sebej

Int. J. Found. Comput. Sci., 2021

On the size of partial derivatives and the word membership problem.

[BibT_eX]

[DOI]

Acta Informatica, 2021

Partial Derivative Automaton by Compressing Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2021

2020

Every Regular Bifix Code is a Finite Union of Regular Infix Codes.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2020

Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels.

[BibT_eX]

[DOI]

Joshua Young

Int. J. Found. Comput. Sci., 2020

On the Average State Complexity of Partial Derivative Transducers.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Theoretical and Implementational Aspects of the Formal Language Server (LaSer).

[BibT_eX]

[DOI]

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Special section on Descriptional Complexity of Formal Systems.

[BibT_eX]

[DOI]

Giovanni Pighizzini

Theor. Comput. Sci., 2019

Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels.

[BibT_eX]

[DOI]

João Pires

Proceedings of the Implementation and Application of Automata, 2019

Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations.

[BibT_eX]

[DOI]

Juraj Sebej

Proceedings of the Implementation and Application of Automata, 2019

2018

Symbolic Manipulation of Code Properties.

[BibT_eX]

[DOI]

Casey Meijer

J. Autom. Lang. Comb., 2018

Randomized generation of error control codes with automata and transducers.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2018

Transducer descriptions of DNA code properties and undecidability of antimorphic problems.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers.

[BibT_eX]

[DOI]

Meng Yang

Algorithms, 2018

2017

Embedding Rationally Independent Languages into Maximal Ones.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Report on DCFS 2017.

[BibT_eX]

[DOI]

Bull. EATCS, 2017

Applications of Transducers in Independent Languages, Word Distances, Codes.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Additive methods for genomic signatures.

[BibT_eX]

[DOI]

Rallis Karamichalis

Stephen Solis-Reyes

BMC Bioinform., 2016

Implementation of Code Properties via Transducers.

[BibT_eX]

[DOI]

Casey Meijer

Proceedings of the Implementation and Application of Automata, 2016

Generating error control codes with automata and transducers.

[BibT_eX]

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015

Implementation and Application of Automata (CIAA 2013).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

An investigation into inter- and intragenomic variations of graphic genomic signatures.

[BibT_eX]

[DOI]

Rallis Karamichalis

BMC Bioinform., 2015

2014

On the maximality of languages with combined types of code properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

Meng Yang

CoRR, 2014

2013

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

[BibT_eX]

[DOI]

Nat. Comput., 2013

Deciding the Density Type of a Given Regular Language.

[BibT_eX]

[DOI]

Joshua Young

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

2012

Formal Descriptions of Code Properties: Decidability, Complexity, Implementation.

[BibT_eX]

[DOI]

Krystian Dudzinski

Int. J. Found. Comput. Sci., 2012

2011

Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

2010

f-Words and Binary Solid Codes.

[BibT_eX]

[DOI]

Joshua Young

J. Autom. Lang. Comb., 2010

On implementing recognizable transductions.

[BibT_eX]

[DOI]

Sheng Yu

Int. J. Comput. Math., 2010

Computing Maximal Error-detecting Capabilities and Distances of Regular Languages.

[BibT_eX]

[DOI]

Pedro V. Silva

Fundam. Informaticae, 2010

2009

State-complexity hierarchies of uniform languages of alphabet-size length.

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Theor. Comput. Sci., 2009

On the definition of stochastic lambda-transducers.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2009

2008

Maximal Error-Detecting Capabilities of Formal Languages.

[BibT_eX]

[DOI]

Pedro V. Silva

J. Autom. Lang. Comb., 2008

State Complexity of the Subword Closure Operation with Applications to DNA Coding.

[BibT_eX]

[DOI]

Cezar Câmpeanu

Int. J. Found. Comput. Sci., 2008

2007

Computing the edit distance of a regular language.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Fuzzification of Rational and Recognizable Sets.

[BibT_eX]

[DOI]

Sheng Yu

Fundam. Informaticae, 2007

Representation and uniformization of algebraic transductions.

[BibT_eX]

[DOI]

Sheng Yu

Acta Informatica, 2007

DNA Coding Using the Subword Closure Operation.

[BibT_eX]

[DOI]

Bo Cui

Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006

(Near-)inverses of sequences.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2006

A Formal Language Analysis of DNA Hairpin Structures.

[BibT_eX]

[DOI]

Elena Losseva

Gabriel Thierrin

Fundam. Informaticae, 2006

2005

On properties of bond-free DNA languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Language equations, maximality and error-detection.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

Bond-free languages: formalizations, maximality and construction methods.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Operations on trajectories with applications to coding and bioinformatics.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Computing the Levenshtein distance of a regular language.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Hairpin Structures in DNA Words.

[BibT_eX]

[DOI]

Elena Losseva

Gabriel Thierrin

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

On Hairpin-Free Words and Languages.

[BibT_eX]

[DOI]

Gabriel Thierrin

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

Descriptional Complexity of Error/Edit Systems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

Asymptotically Optimal Low-Cost Solid Codes.

[BibT_eX]

[DOI]

Nguyen Huong Lam

J. Autom. Lang. Comb., 2004

Substitutions, Trajectories and Noisy Channels.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

Preventing Undesirable Bonds Between DNA Codewords.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Substitution on Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2003

On a simple method for detecting synchronization errors in coded messages.

[BibT_eX]

[DOI]

Steven Perron

L. Amber Wilcox-O'Hearn

IEEE Trans. Inf. Theory, 2003

Coding properties of DNA languages.

[BibT_eX]

[DOI]

Salah Hussini

Theor. Comput. Sci., 2003

Sticky-free and overhang-free DNA languages.

[BibT_eX]

[DOI]

Elena Losseva

Geoff Wozniak

Acta Informatica, 2003

2002

Error-detecting properties of languages.

[BibT_eX]

[DOI]

Amber O'Hearn

Theor. Comput. Sci., 2002

Error-Correction, and Finite-Delay Decodability.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

2001

Relationships between different error-correcting capabilities of a code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Maximal Solid Codes.

[BibT_eX]

[DOI]

Masashi Katsura

J. Autom. Lang. Comb., 2001

An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types.

[BibT_eX]

[DOI]

Inf. Comput., 2001

2000

Error-Detecting Properties of Languages.

[BibT_eX]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

1997

Codes<sup>1</sup>.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

1995

Error Corrections for Channels with Substitutions, Insertions, and Deletions.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications II, 1995

Variable-Length Codes for Error Correction.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1993

The Hierarchy of Codes.

[BibT_eX]

[DOI]