نتایج جستجو برای: long slender
تعداد نتایج: 777947 فیلتر نتایج به سال:
In a recent paper we de ned and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications. TUCS Research Group Mathematical Structures of Computer Science
A linear-slender context-free language is a context-free language whose number of words of length n is linear in n. Its structure has been finely characterized in a work of Ilie, Rozenberg and Salomaa. Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton.
geometric and material nonlinear behavior of slender webs in i-column girders having stocky flanges under the action of combined lateral and axial loads is investigated. interaction curves corresponding to the application of compressive and shear loads at buckling and ultimate stages for both web plates and column sections are plotted. in addition, the effects of flange and web slenderness rati...
The aim of this paper is to determine the stress levels at the end of a long slender shaft such as a drilling assembly used in the oil or gas industry using a mathematical model in real-time. The torsional deflection experienced by this type of drilling shaft (about 4 KM length and 20 cm diameter hollow shaft with a thickness of 1 cm) can only be determined using a distributed modeling techniqu...
In 2013, Borghoff et al. introduced a slender-set linear cryptanalysis on PRESENT-like ciphers with key-dependent secret S-boxes. In this paper, we propose an improved slender-set linear attack to PRESENTlike ciphers with secret S-boxes. We investigate three new cryptanalytic techniques, and use them to recover the secret S-boxes efficiently. Our first new idea is that we propose a new techniqu...
We elucidate the inviscid instabilities of an isentropic torus found previously by Papaloizou & Pringle. The torus is a polytrope of index, n, and has a small ratio of minor radius, a, to orbital radius, r0 • In equilibrium it rotates on cylinders with angular velocity profile O,ocr-q. Linear modes are proportional to exp i (m¢-wt). For small P=ma/r0 , we justify the use of height-averaged equa...
A Π1 class P is called thin if, given a subclass P ′ of P there is a clopen C with P ′ = P ∩C. Cholak, Coles, Downey and Herrmann [7] proved that a Π1 class P is thin if and only if its lattice of subclasses forms a Boolean algebra. Those authors also proved that if this boolean algebra is the free Boolean algebra, then all such think classes are automorphic in the lattice of Π1 classes under i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید