this study explores the nature of relatively free word order of verbs and their arguments in persian. based on the theory of phases and multiple spell-out which is an instantiation of minimalist program, we attempt to account for the restrictions on these word order variations. having a direct interaction with the syntax-phonology interface rather than a purely syntactic one, these restrictions...

Operator precedence grammars define a classical Boolean and deterministic context-free language family (called Floyd languages or FLs). FLs have been shown to strictly include the well-known Visibly Pushdown Languages, and enjoy the same nice closure properties. In this paper we provide a complete characterization of FLs in terms of a suitable Monadic Second-Order Logic. Traditional approaches ...

We define in this paper a certain notion of completeness for a wide class of commutative (pre)ordered monoids (from now on P.O.M.’s). This class seems to be the natural context for studying structures like measurable function spaces, equidecomposability types of spaces, partially ordered abelian groups and cardinal algebras. Then, we can prove that roughly speaking, spaces of measures with valu...

The unwanted zero-order diffraction is still an issue in beam shaping using pixelated spatial light modulators. In this paper, we report a new approach for free by designing asymmetric triangle reflector and introducing digital blazed grating lens to the phase hologram addressed onto modulator. By adding previously reported complex-amplitude coding algorithms, realized generation of complex bea...

We consider the monoid T with the presentation 〈a, b; aab = aba〉 which is “close” to trace monoids. We prove two different types of results. First, we give a combinatorial description of the lexicographically minimum and maximum representatives of their congruence classes in the free monoid {a, b}∗ and solve the classical equations, such as commutation and conjugacy in T. Then we study the clos...