32 research outputs found

    Efficient Seeds Computation Revisited

    Get PDF
    The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalization of periodicity, it is a cover of a superstring of a given string, and the shortest seed problem is of much higher algorithmic difficulty. The problem is not well understood, no linear time algorithm is known. In the paper we give linear time algorithms for some of its versions --- computing shortest left-seed array, longest left-seed array and checking for seeds of a given length. The algorithm for the last problem is used to compute the seed array of a string (i.e., the shortest seeds for all the prefixes of the string) in O(n2)O(n^2) time. We describe also a simpler alternative algorithm computing efficiently the shortest seeds. As a by-product we obtain an O(nlog(n/m))O(n\log{(n/m)}) time algorithm checking if the shortest seed has length at least mm and finding the corresponding seed. We also correct some important details missing in the previously known shortest-seed algorithm (Iliopoulos et al., 1996).Comment: 14 pages, accepted to CPM 201

    Second-Order Dynamics in the Collective Evolution of Coupled Maps and Automata

    Full text link
    We review recent numerical studies and the phenomenology of spatially synchronized collective states in many-body dynamical systems. These states exhibit thermodynamic noise superimposed on the collective, quasiperiodic order parameter evolution with typically one basic irrational frequency. We concentrate on the description of the global temporal properties in terms of second-order difference equations.Comment: 11 pages (plain TeX), 4 figures (PostScript), preprint OUTP-92-51

    Phase-space interference of states optically truncated by quantum scissors: Generation of distinct superpositions of qudit coherent states by displacement of vacuum

    Full text link
    Conventional Glauber coherent states (CS) can be defined in several equivalent ways, e.g., by displacing the vacuum or, explicitly, by their infinite Poissonian expansion in Fock states. It is well known that these definitions become inequivalent if applied to finite dd-level systems (qudits). We present a comparative Wigner-function description of the qudit CS defined (i) by the action of the truncated displacement operator on the vacuum and (ii) by the Poissonian expansion in Fock states of the Glauber CS truncated at (d1)(d-1)-photon Fock state. These states can be generated from a classical light by its optical truncation using nonlinear and linear quantum scissors devices, respectively. We show a surprising effect that a macroscopically distinguishable superposition of two qudit CS (according to both definitions) can be generated with high fidelity by displacing the vacuum in the qudit Hilbert space. If the qudit dimension dd is even (odd) then the superposition state contains Fock states with only odd (even) photon numbers, which can be referred to as the odd (even) qudit CS or the female (male) Schr\"odinger cat state. This phenomenon can be interpreted as an interference of a single CS with its reflection from the highest-energy Fock state of the Hilbert space, as clearly seen via phase-space interference of the Wigner function. We also analyze nonclassical properties of the qudit CS including their photon-number statistics and nonclassical volume of the Wigner function, which is a quantitative parameter of nonclassicality (quantumness) of states. Finally, we study optical tomograms, which can be directly measured in the homodyne detection of the analyzed qudit cat states and enable the complete reconstructions of their Wigner functions.Comment: 14 pages, 10 figure
    corecore