6 citations · 12 across the 9 of their papers we have counts for
10 papers
Independent Languages and Witnesses of Dependence (Non-satisfaction)
Stavros Konstantinidis
We consider the independent language property defined by the language equation φ(X)=\emptyset, where the expression φ involves the language variable X, constant languages, and st…
Approximate NFA Universality and Related Problems Motivated by Information Theory
Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira +1
In coding and information theory, it is desirable to construct maximal codes that can be either variable length codes or error control codes of fixed length. However deciding code…
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations
Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej
We consider the problem of partitioning effectively a given symmetric (and irreflexive) rational relation R into two asymmetric rational relations. This problem is motivated by a r…
Regular Expressions and Transducers over Alphabet-invariant and User-defined Labels
Stavros Konstantinidis, Nelma Moreira, Rogerio Reis +1
We are interested in regular expressions and transducers that represent word relations in an alphabet-invariant way---for example, the set of all word pairs u,v where v is a prefix…
Channels with Synchronization/Substitution Errors and Computation of Error Control Codes
Stavros Konstantinidis, Nelma Moreira, Rogerio Reis
We introduce the concept of an \ff-maximal error-detecting block code, for some parameter \ff{} between 0 and 1, in order to formalize the situation where a block code is close to…
Embedding rationally independent languages into maximal ones
Stavros Konstantinidis, Mitja Mastnak
We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language , find a maximal independent language containing…
Symbolic Manipulation of Code Properties
Stavros Konstantinidis, Casey Meijer, Nelma Moreira +1
The FAdo system is a symbolic manipulator of formal languages objects, implemented in Python. In this work, we extend its capabilities by implementing methods to manipulate transdu…
An investigation into inter- and intragenomic variations of graphic genomic signatures
Rallis Karamichalis, Lila Kari, Stavros Konstantinidis +1
We provide, on an extensive dataset and using several different distances, confirmation of the hypothesis that CGR patterns are preserved along a genomic DNA sequence, and are diff…
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
This work concerns formal descriptions of DNA code properties, and builds on previous work on transducer descriptions of classic code properties and on trajectory descriptions of D…
An efficient algorithm for computing the edit distance of a regular language via input-altering transducers
Lila Kari, Stavros Konstantinidis, Steffen Kopecki +1
We revisit the problem of computing the edit distance of a regular language given via an NFA. This problem relates to the inherent maximal error-detecting capability of the languag…