is not always true for square integer matricesM and N . The most basic example of a semigroup is the set, Σ∗, of strings over an alphabet, Σ, where the binary operation is concatenation. In fact, we take the associativity of concatenation so much for granted that we typically write xyz for the concatenation of x, y, z ∈ Σ∗, without bothering to indicate whether they were concatenated as (x ◦ y)...

An important problem in concatenative synthesis is the occurence of spectral discontinuities or “concatenation mismatch” between sonorant speech units. In this paper, we present an approach to reduce concatenation mismatch by combining spectral information from two sequences of speech units selected in parallel. Concatenation units, on one hand, define initial spectral trajectories for a target...

Concatenation by covalent linkage of two protomers of an intertwined all-helical HP0242 homodimer from Helicobacter pylori results in the first example of an engineered knotted protein. While concatenation does not affect the native structure according to X-ray crystallography, the folding kinetics is substantially slower compared to the parent homodimer. Using NMR hydrogen-deuterium exchange a...

This paper is devoted to the study of the bideterministic concatenation product, a variant of the concatenation product. We give an algebraic characterization of the varieties of languages closed under this product. More precisely, let V be a variety of monoids, V the corresponding variety of languages and V̂ the smallest variety containing V and the bideterministic products of two languages of ...

What is the significance of combining expressions in a natural human language? A complex expression is not a mere list of words. Combining expressions, as in 'red ball' or 'ball that Pat kicked yesterday' has a semantic effect. But how is the meaning of a phrase related to the meanings of its constituents? And how are the meanings of predicates, simple or complex, related to the meanings of sen...

Parsing for Two-staged Languages with Concatenation ∗ Soonho Kong Wontae Choi Kwangkeun Yi Seoul National University {soon,wtchoi,kwang}@ropas.snu.ac.kr Abstract This article, based on Doh, Kim, and Schmidt’s “abstract parsing” technique, presents an abstract interpretation for statically checking the syntax of generated code in two-staged programs. Abstract parsing is a static analysis techniq...

For any sentence of a natural language, we can ask the following questions: what is its meaning; what is its syntactic structure; and how is its meaning related to its syntactic structure? Attending to these questions, as they apply to sentences that provide evidence for Davidsonian event analyses, suggests that we reconsider some traditional views about how the syntax of a natural sentence is ...

An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a class K of string languages, Int(K) is the class of all graph languages that are interpretations of languages from K. For the class REG of regular languages, Int(REG) might be called the class of regular graph languages; i...

We consider the problem stated by Andrzej Grzegorczyk in “Undecidability without arithmetization” (Studia Logica 79(2005)) whether certain weak theory of concatenation is essentially undecidable. We give a positive answer for this problem.