The complexity of testing ground reducibility for linear word rewriting systems with variables

Author(s):  
Gregory Kucherov ◽  
Michaël Rusinowitch
1985 ◽  
Vol 24 (1) ◽  
pp. 3-17
Author(s):  
Valerii Gorbunov
Keyword(s):  

Author(s):  
O. Maistrenko ◽  
M. Petrushenko ◽  
S. Nikul ◽  
Y. Sinilo

The article analyzes the possible risks that can arise when firing artillery and rocket launches. The disadvantages of the method of calculating the protection zones are identified, which taking into account will reduce the likelihood of the occurrence of abnormal situations, which can lead to tragic consequences and damage to objects adjacent to the boundary of the testing ground. Additions to the procedure for determining the protection zones of the test site in the interests of RVIA are proposed and the specified, correct sizes of these zones are provided. Development of rocket troops and artillery (RTaA) of the Armed Forces (AF) of Ukraine is impossible without a permanent improvement and modernisation of types of armament and ammunition to them, development of the new artillery systems and their ground tests. During realization of ground tests of types of armament and military technique (WME) of RTaA firing of artillery and starting of rockets is accompanied by errors or wrong acts of WME attendant and personnel or extraneous persons, the consequences of that must be envisaged, and the risk of their origin is Analysis of the battle firing, including during realization of anti-terror operation and operation of the incorporated forces on east of Ukraine row of ground tests of standards of WME RTaA test if possibility of origin of nonpermanent near-accidents during application of armament of RtaA as a result of rejection of trajectory of flight of projectile (mines) by the direction and distance from the expected targets. Mostly it happens through untaking into account of maximal rejections of meteorological and ballistic terms of firing from tabular or errors in calculations, wrong acquisition of charge, error at aiming of fighting machines, cannons, mortars. There for practice of the battle firing needs taking into account of these errors, that will give an opportunity consider ably to promo test rength security at application of armament of RAaT during testing of standards of WME. Thus, in the article certainly and possible risks that can arise up during realization of firing of artillery and starting of rockets are analysed, related to the lacks of existent methodology of realization of calculations in relation to providing of safety measures during the tests of WME RtaA. Suggestions are brought in, in relation to the improvement of methodology of realization of calculations of sizes of protective zones, that unlike existing more in detail take into account maximal deviations of terms of firing from tabular values. These suggestions for providing of safety measures it will be allowed to decrease probability of origin of situations, that can result in tragic consequences and to causing of damages to the objects that fit closely to the limits of training field. Anoffer adding to the order of determination of protective zones and given specified sizes of the sezones have an important practical value at determination of possibilities of grounds and providing of safety of testing and battle firing (starting) of RtaA.


1982 ◽  
Vol 5 (3-4) ◽  
pp. 279-299
Author(s):  
Alberto Pettorossi

In this paper we consider combinators as tree transducers: this approach is based on the one-to-one correspondence between terms of Combinatory Logic and trees, and on the fact that combinators may be considered as transformers of terms. Since combinators are terms themselves, we will deal with trees as objects to be transformed and tree transformers as well. Methods for defining and studying tree rewriting systems inside Combinatory Weak Reduction Systems and Weak Combinatory Logic are also analyzed and particular attention is devoted to the problem of finiteness and infinity of the generated tree languages (here defined). This implies the study of the termination of the rewriting process (i.e. reduction) for combinators.


2021 ◽  
Vol 178 (3) ◽  
pp. 173-185
Author(s):  
Arthur Adinayev ◽  
Itamar Stein

In this paper, we study a certain case of a subgraph isomorphism problem. We consider the Hasse diagram of the lattice Mk (the unique lattice with k + 2 elements and one anti-chain of length k) and find the maximal k for which it is isomorphic to a subgraph of the reduction graph of a given one-rule string rewriting system. We obtain a complete characterization for this problem and show that there is a dichotomy. There are one-rule string rewriting systems for which the maximal such k is 2 and there are cases where there is no maximum. No other intermediate option is possible.


1993 ◽  
Vol 02 (04) ◽  
pp. 915-921 ◽  
Author(s):  
C. RANGACHARYULU ◽  
A. RICHTER

It is pointed out that the y-dependence of the differential cross-section for various types of neutrinos on the electron promises to be a sensitive testing ground of the electroweak Standard Model at KAON in Vancouver. Estimates of the flux requirements are given and the feasibility of such experiments is discussed.


2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE

We compile pattern matching for overlapping patterns in term rewriting systems into a minimal, tree matching automata. The use of directed acyclic graphs that shares all the isomorphic subautomata allows us to reduce space requirements. These are duplicated in the tree automaton. We design an efficient method to identify such subautomata and avoid duplicating their construction while generating the dag automaton. We compute some bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton.


Sign in / Sign up

Export Citation Format

Share Document