We study the expressive power of linear propositional temporal logic interpreted on finite sequences or words. We first give a transparent proof of the fact that a formal language is expressible in this logic if and only if its syntactic semigroup is finite and aperiodic. This gives an effective algorithm to decide whether a given rational language is… (More)
A new string-matching algorithm is presented, which can be viewed as an intermediate between the classical algorithms of Knuth, Morris, and Pratt on the one hand and Boyer and Moore, on the other hand. The algorithm is linear in time and uses constant space as the algorithm of Galil and Seiferas. It presents the advantage of being remarkably simple which… (More)
Cern´y's conjecture asserts the existence of a synchronizing word of length at most (n − 1) 2 for any synchronized n-state deterministic automaton. We prove a quadratic upper bound on the length of a synchronizing word for any synchronized n-state deterministic automaton satisfying the following additional property: there is a letter a such that for any… (More)
We relate the Burrows-Wheeler transformation with a result in com-binatorics on words known as the Gessel-Reutenauer transformation.
Non-competitive N-methyl-d-aspartate (NMDA) blockers induce schizophrenic-like behavior in healthy volunteers and exacerbate symptomatology in schizophrenic patients. Hence, a compound able to enhance NMDA neurotransmission by increasing levels of d-serine, an endogenous full agonist at the glycine site of the NMDA receptors, could have anti-psychotic… (More)