The stipulative nature of the (generalized) EPP – the requirement that certain functional heads have filled specifiers – has led to numerous attempts to subsume its effects within other properties of natural language (e.g. Fukui & Speas 1986; Bošković 1997, 2002, 2007; Martin 1999; Grohmann et al. 2000; Epstein & Seely 2006; Landau 2007; Bjorkman & Zeijlstra 2014; Richards 2014; McFadden & Sund...

A new q-analog of Genocchi numbers is introduced through a q-analog of Seidel’s triangle associated to Genocchi numbers. It is then shown that these q-Genocchi numbers have interesting combinatorial interpretations in the classical models for Genocchi numbers such as alternating pistols, alternating permutations, non intersecting lattice paths and skew Young tableaux.

‘Leaf-size’ (or ‘branching’) is the minimum number of leaves of some accepting computation trees of alternating devices. For example, one leaf corresponds to nondeterministic computation. In this paper, we investigate the effect of constant leaves of three-dimensional alternating Turing machines, and show the following facts : (1) For cubic input tapes, k leafand L(m) space-bounded three-dimens...

We develop a game-based protocol semantics, by modeling protocols as concurrent game structures. To be precise, we take protocol specifications from the Cremers–Mauw protocol semantics, and interpret such protocol specifications in concurrent game structures instead of in labeled transition systems. This allows us to define security properties on Cremers–Mauw protocol specifications in logics o...

Sensory systems are thought to have evolved to efficiently represent the full range of sensory stimuli encountered in the natural world. The statistics of natural environmental sounds are characterized by scale-invariance: the property of exhibiting similar patterns at different levels of observation. The statistical structure of scale-invariant sounds remains constant at different spectro-temp...

We show that a tree language recognized by a deterministic parity automaton is either hard for the co–Büchi level and therefore cannot be recognized by a weak alternating automaton, or is on a very low level in the hierarchy of weak alternating automata. A topological counterpart of this property is that a deterministic tree language is either Π 1 complete (and hence non Borel), or it is on the...

Examples suggest that there is a correspondence between L-spaces and 3manifolds whose fundamental groups cannot be left-ordered. In this paper we establish the equivalence of these conditions for several large classes of such manifolds. In particular, we prove that they are equivalent for any closed, connected, orientable, geometric 3-manifold that is non-hyperbolic, a family which includes all...