the present study adopts the perspective that metacognitive strategy instruction is bound to occur inside the classroom especially on oral tasks. accordingly, the researchers investigated whether metacognitive strategy instruction prior to oral tasks was more successful than conventional ways in improving efl learners’ oral proficiency. to this end, 56 participants studying in a language school...

rupture and wrinkling are two prevalent phenomena that happen in hydro-forming process. many efforts have been made to achieve the upper and lower bounds for the pressure related to rupture and wrinkling of sheet, respectively. the aim of this investigation is to improve the upper bound of fluid pressure in hydro-forming process by hemispherical punch. in this article, analytical study of the u...

the aim of this study was to investigate the effect of the addition of commercial lipase in various forms on the acceleration of the ripening of uf-feta cheese. commercial lipase from aspergillus niger was encapsulated by using silica composition based on sol-gel method. lipase was then added to cheeses in three forms, namely, free lipase, encapsulated lipase, and encapsulated lipase with arabi...

abstract zinc (zn) is an essential plant nutrient. knowledge about distribution of zn between its different chemical forms is useful in understanding the chemistry of this element in soil and also in development of soil testing procedures. the present study was conducted to obtain such information about distribution of zinc forms in 20 soil samples of lorestan province by the use of a sequentia...

We show that the neighbourhood of a regular language L with respect to an additive quasi-distance can be recognized by an additive weighted finite automaton (WFA). The size of the WFA is the same as the size of an NFA (nondeterministic finite automaton) for L and the construction gives an upper bound for the state complexity of a neighbourhood of a regular language with respect to a quasi-dista...

Consider the finite regular language Ln = {w0 | w ∈ {0, 1}, |w| ≤ n}. In [3] it was shown that while this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum finite automaton (QFA) for it has size 2 . This was based on the fact that the evolution of a QFA is required to be reversible. When arbitrary intermediate measurements are allowed, this intuition bre...

The tight upper bound on the state complexity of the reverse of R-trivial and J -trivial regular languages of the state complexity n is 2n−1. The witness is ternary for R-trivial regular languages and (n− 1)ary for J -trivial regular languages. In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J -trivial regular language over an (n − 2)-el...

We consider the recognition problem of Dyck Language generalized for multiple types brackets. provide an algorithm with quantum query complexity \(O(\sqrt{n}(\log n)^{0.5k})\), where n is length input and k maximal nesting depth Additionally, we show lower bound this which \(\varOmega (\sqrt{n}c^{k})\) some constant c.Interestingly, classical algorithms solving brackets substantially differ fro...