Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under $\theta$ ($\theta$-invariant for short).We establish an extension of the famous defect theorem. Moreover, we prove that for the so-called thin $\theta$-invariant codes, maximality and completeness are two equivalent notions. We prove that a similar property holds in the framework of some special families of $\theta$-invariant codes such as prefix (bifix) codes, codes with a finite deciphering delay, uniformly synchronized codes and circular codes. For a special class of involutive antimorphisms, we prove that any regular $\theta$-invariant code may be embedded into a complete one.Comment: To appear in Acts of WORDS 201

Metabolic alterations in experimental models of depression

Introduction: Major depressive disorder is one of the most prevalent psychiatric disorders and is associated with a severe impact on the personal functioning, thus with incurring significant direct and indirect costs. The presence of depression in patients with medical comorbidities increases the risks of myocardial infarction and decreases diabetes control, and adherence to treatment. The mechanism through which these effects are produced is still uncertain. Objectives of this study were to evaluate the metabolic alterations in female Wistar rats with induced depression, with and without administration of Agomelatine. The methods included two experiments. All data were analyzed by comparison with group I (control), and with each other. In the first experiment we induced depression by: exposure to chronic mild stress-group II; olfactory bulbectomy-group III; and exposure to chronic mild stress and hyperlipidic/ hyper caloric diet-group IV. The second experiment was similar with the first but the rats received Agomelatine (0.16mg/ animal): group V (depression induced through exposure to chronic mild stress), VI (depression induced through olfactory bulbectomy) and VII (depression induced through exposure to chronic mild stressing hyperlipidic/ hypercaloric diet). Weight, cholesterol, triglycerides and glycaemia were measured at day 0 and 28, and leptin value was measured at day 28. The results in the 1st experiment revealed significant differences (pconclusion, significant correlations were found between high level of triglycerides and depression induced by chronic stress and olfactory bulbectomy. Agomelatine groups had a lower increase of triglycerides levels

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions

The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions. More precisely, we extend partial derivation of regular expressions to two-sided partial derivation of hairpin expressions and we show how to deduce a recognizer for a hairpin expression from its two-sided derived term automaton, providing an alternative proof of the fact that hairpin completions of regular languages are linear context-free.Comment: 28 page

Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections

In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs). We show that there are universal ANEPFCs of size 10, by devising a method for simulating 2-Tag Systems. This result significantly improves the known upper bound for the size of universal ANEPFCs which is 18. We also propose a new, computationally and descriptionally efficient simulation of nondeterministic Turing machines by ANEPFCs. More precisely, we describe (informally, due to space limitations) how ANEPFCs with 16 nodes can simulate in O(f(n)) time any nondeterministic Turing machine of time complexity f(n). Thus the known upper bound for the number of nodes in a network simulating an arbitrary Turing machine is decreased from 26 to 16

Pattern Matching with Variables: Fast Algorithms and New Hardness Results

A pattern (i. e., a string of variables and terminals) maps to a word, if this is obtained by uniformly replacing the variables by terminal words; deciding this is NP-complete. We present efficient algorithmsfootnote{The computational model we use is the standard unit-cost RAM with logarithmic word size. Also, all logarithms appearing in our time complexity evaluations are in base 2.} that solve this problem for restricted classes of patterns. Furthermore, we show that it is NP-complete to decide, for a given number k and a word w, whether w can be factorised into k distinct factors; this shows that the injective version (i.e., different variables are replaced by different words) of the above matching problem is NP-complete even for very restricted cases

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number

We investigate the locality number, a recently introduced structural parameter for strings (with applications in pattern matching with variables), and its connection to two important graph-parameters, cutwidth and pathwidth. These connections allow us to show that computing the locality number is NP-hard but fixed-parameter tractable (when the locality number or the alphabet size is treated as a parameter), and can be approximated with ratio O(sqrt{log{opt}} log n). As a by-product, we also relate cutwidth via the locality number to pathwidth, which is of independent interest, since it improves the best currently known approximation algorithm for cutwidth. In addition to these main results, we also consider the possibility of greedy-based approximation algorithms for the locality number

Revisiting Shinohara's algorithm for computing descriptive patterns

A pattern α is a word consisting of constants and variables and it describes the pattern language L(α) of all words that can be obtained by uniformly replacing the variables with constant words. In 1982, Shinohara presents an algorithm that computes a pattern that is descriptive for a finite set S of words, i.e., its pattern language contains S in the closest possible way among all pattern languages. We generalise Shinohara’s algorithm to subclasses of patterns and characterise those subclasses for which it is applicable. Furthermore, within this set of pattern classes, we characterise those for which Shinohara’s algorithm has a polynomial running time (under the assumption P 6= N P). Moreover, we also investigate the complexity of the consistency problem of patterns, i.e., finding a pattern that separates two given finite sets of words

The influance of intracerebroentricular administration of (±)propanol and(±)verapamil on experimental myocardial ischemia and necrosis in rats

In albino rats, infarctoid myocardial lesions were produced by intraperitoneal (i.p.) administration of isoproterenol (75 mg/kg, during 3 days). In other groups, the descending anterior left coronary artery was ligated. In both experimental settings, the intracerebroventricular (i.c.v.) administration of ( ± ) propranolol (100-200-300 μ g/animal/day, during 7 days) or ( ± ) verapamil (40-80-160 μ g/animal/day, during 7 days) afforded a significant protection (with the exception of the lowest dose) on the investigated parameters: arrhythmias, ischemic zone (in coronary ligated rats), lactate dehydrogenase and aspartate aminotransferase activity of the serum, focal necrosis (in isoproterenol treated rats). This protective activity is lower than that afforded by i.p. administered (±) propranolol (5 mg/kg, during seven days) or (±) verapamil (5 mg/kg, during seven days). From these data it may be concluded that (±) propranolol and (±) verapamil have a protective action on the experimental myocardial ischemia and necrosis in rats, not only when the drugs come in direct contact with the heart, but also acting upon the central nervous system