The decomposition kinetics of peroxide products contained in the liquid phase of the LiOH-H2O2-H2O ternary system were studied, and the applicability of the solubility method to studying this system ...was demonstrated for hydrogen peroxide concentrations in the liquid phase from 2 to 6 wt % and temperatures of 21--33DGC. The stabilizing influence of solid Li2O2 DT H2O on hydrogen peroxide decomposition was demonstrated. The temperature and concentration boundaries of existence were determined for the Li2O2 DT H2O phase, whose identity was verified by chemical analysis and qualitative X-ray powder diffraction analysis.
Decomposition kinetics of peroxide compounds in the liquid phase of the system KOH-H
2
O
2
-H
2
O at an initial hydrogen peroxide concentration of about 14.5 M and pH 12.7 in vessels made of Pyrex ...glass, polyethylene terephthalate, and 12Kh18N10T steel was studied in the temperature range from −10 to +50°C. The main kinetic parameters of the processes under study were determined. The influence exerted by the material of the reaction vessel on the kinetics and mechanism of decomposition of peroxide compounds in the liquid phase of the system under study were determined.
The decomposition kinetics of peroxide products contained in the liquid phase of the LiOH-H
2
O
2
-H
2
O ternary system were studied, and the applicability of the solubility method to studying this ...system was demonstrated for hydrogen peroxide concentrations in the liquid phase from 2 to 6 wt % and temperatures of 21–33°C. The stabilizing influence of solid Li
2
O
2
· H
2
O on hydrogen peroxide decomposition was demonstrated. The temperature and concentration boundaries of existence were determined for the Li
2
O
2
· H
2
O phase, whose identity was verified by chemical analysis and qualitative X-ray powder diffraction analysis.
The kinetics of decomposition of hydrogen peroxide in the liquid phase of the ternary system LiOH-H
2
O
2
-H
2
O was studied in the presence the solid phase of Li
2
O
2
·H
2
O and without it. The ...main kinetic parameters of the processes studied were determined.
The paper investigates the state complexity of two operations on regular languages, known as GF(2)-concatenation and GF(2)-inverse (Bakinova et al., “Formal languages over GF(2)”, LATA 2018), in the ...case of a one-symbol alphabet. The GF(2)-concatenation is a variant of the classical concatenation obtained by replacing Boolean logic in its definition with the GF(2) field; it is proved that GF(2)-concatenation of two unary languages recognized by an m-state and an n-state DFA is recognized by a DFA with 2mn states, and this number of states is necessary in the worst case, as long as m and n are relatively prime. This operation is known to have an inverse, and the state complexity of the GF(2)-inverse operation over a unary alphabet is proved to be exactly 2n−1+1, with the proof based on primitive polynomials over GF(2). For a generalization of the GF(2)-inverse, called the GF(2)-star, the state complexity in the unary case is exactly 2n.
GF(2)-operations on formal languages (Bakinova et al., “Formal languages over GF(2)”, Inf. Comput., 2022) are variants of the classical concatenation and Kleene star obtained by replacing Boolean ...logic in their definitions with the GF(2) field. This paper investigates closure and non-closure of basic families of languages under these operations. First, it is proved that the group languages (those defined by permutation automata) are closed under GF(2)-concatenation and not closed under GF(2)-star; furthermore, the state complexity of GF(2)-concatenation for m-state and n-state permutation automata is determined as m⋅2n. Next, it is shown that the languages defined by trellis automata (one-way real-time cellular automata) are not closed under either operation, but are closed under GF(2)-concatenation with regular languages; the context-free languages and their linear and unambiguous variants are not closed under GF(2)-concatenation with a two-element set, nor under GF(2)-star; the LR(k) languages are closed under GF(2)-concatenation with a regular set on the right, but not on the left.
•Two operations on formal languages, GF(2)-concatenation and GF(2)-star, are investigated.•The language family recognized by permutation automata is closed under GF(2)-concatenation, but not under GF(2)-star.•The language families defined by context-free grammars and their main subclasses are not closed under either operation.•The family recognized by trellis automata is closed under GF(2)-concatenation with regular sets.•The family defined by LR(k) grammars is closed under GF(2) concatenation with regular sets on the right, but not on the left.
The article is devoted to the consideration of problems associated with the lack of animal registration systems in government agencies, information about them, the selection of animals for new ...owners, as well as the search for a suitable veterinary clinic, shelter or pet store. In the article, the authors reveal the possibilities of using automation tools to create animal profiles, selection filters that will allow you to choose the most suitable pet, and also provide the opportunity to find shelters and veterinary clinics. As a result of the analysis of the subject area, the authors formed functional requirements, presented a platform for implementing a web application, an integrated development environment, as well as a high-level Django framework, which made it possible to create a web application for shelters that allows you to search for pets and also contains an online map displaying veterinary clinics, shelters and pet stores.
Formal languages over GF(2) Bakinova, Ekaterina; Basharin, Artem; Batmanov, Igor ...
Information and computation,
02/2022, Volume:
283
Journal Article
Peer reviewed
Variants of the union and concatenation operations on formal languages are investigated, in which Boolean logic in the definitions (that is, conjunction and disjunction) is replaced with the ...operations in the two-element field GF(2) (conjunction and exclusive OR). Union is thus replaced with symmetric difference, whereas concatenation gives rise to a new GF(2)-concatenation operation, which is notable for being invertible. All operations preserve regularity, and for a pair of languages recognized by an m-state and an n-state DFA, their GF(2)-concatenation is recognized by a DFA with m⋅2n states, and this number of states is in the worst case necessary. Similarly, the state complexity of GF(2)-inverse is 2n+1. Next, a new class of formal grammars based on GF(2)-operations is defined, and it is shown to have the same computational complexity as ordinary grammars with union and concatenation: in particular, simple parsing in time O(n3), fast parsing in the time of matrix multiplication, and parsing in NC2.
