Layered transducing term rewriting system and its recognizability preserving property

A term rewriting system which effectively preserves recognizability (EPR-TRS) has good mathematical properties, In this paper, a new subclass of TRSs, layered transducing TRSs (LT-TRSs) is defined and its rccognizability preserving property is discussed. The class of LT-TRSs contains some EPR-TRSs, e.g., {f(x)-f(g(x))} which do not belong to any of the known decidable subclasses of EPR-TRSs. Bottom-up linear tree transducer, which is a well-known computation model in the tree language theory, is a special case of LT-TRS. We present a sufficient condition for an LT-TRS to be an EPR-TRS. Also reachability and joinability are shown to be decidable for LT-TRSs

Изучение спектрально-люминесцентных свойств гамма-пирилоцианинов и их гетероаналогов

Изучены спектрально-люминесцентные свойства гамма-пирилоцианинов и их гетероаналогов с модифицированными комплексными анионами. Показано, что происходит уменьшение квантовых выходов флуоресценции в ряду пирило-, тиапирило-, селенпирило- для моно- и триметинцианинов и при замене в молекуле красителя аниона ClO[4] - на анион TlCl[4] - в результате увеличения вероятности синглет-триплетных переходов под влиянием тяжелых атомов

The κ-lattice: Decidability boundaries for qualitative analysis in biological languages

The κ-calculus is a formalism for modelling molecular biology where molecules are terms with internal state and sites, bonds are represented by shared names labelling sites, and reactions are represented by rewriting rules. Depending on the shape of the rewriting rules, a lattice of dialects of κ can be obtained. We analyze the expressive power of some of these dialects by focusing on the thin boundary between decidability and undecidability for problems like reachability and coverability