Closure properties and decision problems of dag automata

A two-sided extension of strictly locally testable languages is presented. In order to determine membership within a two-sided strictly locally testable language, the input must be scanned from both ends simultaneously, whereby it is synchronously checked that the factors read are correlated with respect to a given binary relation. The class of two-sided strictly locally testable languages is shown to be a proper subclass of the even linear languages that is incomparable to the regular languages with respect to inclusion. Furthermore, closure properties of the class of two-sided strictly locally testable languages and decision problems are studied. Finally, it is shown that two-sided strictly k-testable languages are learnable in the limit from positive data.

Download Full-text

SOME REMARKS ON THE HAIRPIN COMPLETION

International Journal of Foundations of Computer Science ◽

10.1142/s0129054110007593 ◽

2010 ◽

Vol 21 (05) ◽

pp. 859-872 ◽

Cited By ~ 7

Author(s):

FLORIN MANEA ◽

VICTOR MITRANA ◽

TAKASHI YOKOMORI

Keyword(s):

Regular Language ◽

Regular Languages ◽

Decision Problems ◽

Strict Sense ◽

Closure Properties ◽

New Words ◽

The Family

We consider several problems regarding the iterated or non-iterated hairpin completion of some subclasses of regular languages. Thus we obtain a characterization of the class of regular languages as the weak-code images of the k-hairpin completion of center-disjoint k-locally testable languages in the strict sense. This result completes two results from [3] and [11]. Then we investigate some decision problems and closure properties of the family of the iterated hairpin completion of singleton languages. Finally, we discuss some algorithms regarding the possibility of computing the values of k such that the non-iterated or iterated k-hairpin completion of a given regular language does not produce new words.

Download Full-text

OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS

International Journal of Foundations of Computer Science ◽

10.1142/s0129054105003145 ◽

2005 ◽

Vol 16 (03) ◽

pp. 531-546 ◽

Cited By ~ 2

Author(s):

LILA KARI ◽

STAVROS KONSTANTINIDIS ◽

PETR SOSÍK

Keyword(s):

Decision Problems ◽

Unified Framework ◽

Closure Properties ◽

Noisy Channels ◽

Insertion And Deletion ◽

Binary Word ◽

Model Complex ◽

Dna Strands ◽

Substitution Type

We study binary word operations of the insertion, deletion and substitution type. Many of these operations can be generalized into a unified framework by introducing so-called trajectory condition. This generalization has been previously made for insertion and deletion operations. In this paper we naturally extend this approach also to substitution operations. We study closure properties and decision problems of substitutions on trajectories. The obtained results are then applied to model complex noisy channels and a cryptanalysis problem. Another application concerns the design of sets of DNA strands without undesired bonds.

Download Full-text

Further Defining the Cognitive and Relational Dimensions of Career Decision Problems

PsycEXTRA Dataset ◽

10.1037/e531792007-001 ◽

2006 ◽

Author(s):

Kevin R. Kelly ◽

Jia Lu

Keyword(s):

Career Decision ◽

Decision Problems

Download Full-text

Bipolar Abstract Argumentation with Dual Attacks and Supports

Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning ◽

10.24963/kr.2020/69 ◽

2020 ◽

Author(s):

Nico Potyka

Keyword(s):

Computational Complexity ◽

Decision Problems ◽

Abstract Argumentation ◽

Stable Semantics ◽

Support Relations ◽

Support Relationships ◽

Computational Properties ◽

Inherent Tendency

Bipolar abstract argumentation frameworks allow modeling decision problems by defining pro and contra arguments and their relationships. In some popular bipolar frameworks, there is an inherent tendency to favor either attack or support relationships. However, for some applications, it seems sensible to treat attack and support equally. Roughly speaking, turning an attack edge into a support edge, should just invert its meaning. We look at a recently introduced bipolar argumentation semantics and two novel alternatives and discuss their semantical and computational properties. Interestingly, the two novel semantics correspond to stable semantics if no support relations are present and maintain the computational complexity of stable semantics in general bipolar frameworks.

Download Full-text