A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The notion can be generalized for arbitrary language operations. We consider decidability properties of language orthogonality and the solvability of language equations involving the orthogonal concatenation operation. We esta...

Recent work on the application of turbo decoding techniques to partial response class 4 (PR4) channels has focused on parallel concatenation systems that require three APP detectors. A simplified serial concatenation system will be presented that uses as its outer code a single convolutional code and as its inner code the partial response channel. An extension of this serial concatenation syste...

We present a new technique for demonstrating the reachability of states in deterministic finite automata representing the concatenation of two languages. Such demonstrations are a necessary step in establishing the state complexity of the concatenation of two languages, and thus in establishing the state complexity of concatenation as an operation. Typically, ad-hoc induction arguments are used...

Abstract In the language $$\lbrace 0, 1, \circ , \preceq \rbrace $$ { 0 , 1 ? ? } where 0 and 1 are constant symbols, $$\circ is a binary function symbol $$\preceq relation symbol, we f...

A universal method for the concatenation of a sequence Markov right processes is established. It then applied to continued pasting two processes, which can be used pathwise constructions locally defined like Brownian motions on compact intervals.

Record concatenation, multiple inheritance, and multiple-object cloning are closely related and part of various language designs. For example, in Cardelli’s untyped Obliq language, a new object can be constructed from several existing objects by cloning followed by concatenation; an error is given in case of field name conflicts. Type systems for record concatenation have been studied by Wand, ...