The present study investigates whether phonetic lessons enable improvement of adult L2 perception and whether 2) L2 perceptual learning in the classroom setting can be explained by the Second Language Linguistic Perception (L2LP) model (Escudero, 2005). Salento Italian (SI) listeners' initial state of perception of American English (AE) vowels was examined. SI listeners performed cross‐ languag...

Prosodic Theory and, in particular, the Strict Layer Hypothesis (SLH), maintain that each level of the prosodic hierarchy is fully contained within the level dominating it (Nespor and Vogel 1986; Selkirk 1995). However, in some languages a syllable is not necessarily contained within a single Prosodic Word (PW). In this paper, we investigate two such cases of violation of the SLH, and offer a n...

Let G = (V, E) be a simple graph with vertex set V and edge set E. A function f from V to a set {-1, 1} is said to be a nonnegative signed dominating function (NNSDF) if the sum of its function values over any closed neighborhood is at least zero. The weight of f is the sum of function values of vertices in V. The nonnegative signed domination number for a graph G equals the minimum weight of a...

Let k~l be an integer, and let G = (V, E) be a graph. The closed kneighborhood N k[V] of a vertex v E V is the set of vertices within distance k from v. A 3-valued function f defined on V of the form f : V --+ { -1,0, I} is a three-valued k-neighborhood dominating function if the sum of its function values over any closed k-neighborhood is at least 1. The weight of a threevalued k-neighborhood ...

3 A function f : V (G) → {+1,−1} defined on the vertices of a graph G is a signed domi4 nating function if for any vertex v the sum of function values over its closed neighborhood 5 is at least one. The signed domination number γs(G) of G is the minimum weight of a 6 signed dominating function on G. By simply changing “{+1,−1}” in the above definition 7 to “{+1, 0,−1}”, we can define the minus ...