We study the state complexity of boolean operations, concatenation, and star, with one or two of the argument languages reversed. We derive tight upper bounds for the symmetric differences and differences of such languages. We prove that the previously discovered bounds for union, intersection, concatenation and star of such languages can all be met by the recently introduced universal witness ...

In this paper, we propose a new method to concatenate two dynamic full-body motions such as punches, kicks, and flips by using the angular momentum as a cue. Through the observation of real humans, we have identified two patterns of angular momentum that make the transition of such motions efficient. Based on these observations, we propose a new method to concatenate two full-body motions in a ...

A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existential quantifier; the dual of Kleene star is defined accordingly. These operations arise whenever concatenation or star appear in the scope of negation. The basic properties of the new operations are determined in the pape...

Graph concatenation for quantum codes Salman Beigi,1 Isaac Chuang,2 Markus Grassl,3 Peter Shor,4 and Bei Zeng5,6,a) 1Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125, USA 2Department of Physics and Department of Electric Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA 3Centre for Quantu...

In this paper we present new constraints to EPCglobal Class 1 Generation 2 (EPCC1 G2) standard which if they have been considered in the design of EPC-C1 G2 complaint authentication protocols, lead to prevent predecessor’s protocols’ weaknesses and also present the secure ones. Also in this paper as an example, we use Pang et al. EPC-C1 G2-friendly protocol which has been recently proposed, to ...