Koskenniemi’s two-level morphology was the first practical general model in the history of computational linguistics for the analysis of morphologically complex languages. In this article we will reconsider one of the key innovations in Koskenniemi (1983), namely the treatment of consonant gradation in finite state transducers. We will look not at Finnish, but at two languages with a more exten...

In two experiments involving the delayed alternation task, monkeys with lesions of the hippocampal formation and monkeys with lesions of cingulate cortex were compared with controls. Either of these lesions caused impairment in original postoperative learning of delayed alternation; the hippocampal formation resections also produced a deficit in the retention of preoperatively acquired delayed ...

We extract a novel quantum programming paradigm superposition of programs from the design idea of a popular class of quantum algorithms, namely quantum walkbased algorithms. The generality of this paradigm is guaranteed by the universality of quantum walks as a computational model. A new quantum programming language QGCL is then proposed to support the paradigm of superposition of programs. Thi...

This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs). With these alternation-elimination constructions at hand, we straightforwardly obtain translations from various temporal logics over nested words from the literature like CaRet and μNWTL, and extensions thereof to NWAs, which correct, simplify, improve, and generalize the pr...