Related papers: Dyck language and fermionic second quantization: I…

We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…

It is shown how to endow a hierarchy of sets of binary patterns with the structure of an abstract,normed C*-algebra. In the course we also recover an intermediate connection with the words of a Dyck language and Tempereley-Lieb algebras for…

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

The Dyck language, which consists of well-balanced sequences of parentheses, is one of the most fundamental context-free languages. The Dyck edit distance quantifies the number of edits (character insertions, deletions, and substitutions)…

Dyck paths (also balanced brackets and Dyck words) are among the most heavily studied Catalan families. This paper is a continuation of [2, 3]. In the paper we enumerate the terms of the OEIS A036991, Dyck numbers, and construct a…

Dyck reachability is the standard formulation of a large domain of static analyses, as it achieves the sweet spot between precision and efficiency, and has thus been studied extensively. Interleaved Dyck reachability (denoted $D_k\odot…

In our previous work [1] we described quantized computation using Horn clauses and based the semantics, dubbed as entanglement semantics as a generalization of denotational and distribution semantics, and founded it on quantum probability…

The algebraic formulation of Wick's theorem that allows one to present the vacuum or thermal averages of the chronological product of an arbitrary number of field operators as a determinant (permanent) of the matrix is proposed. Each…

We study a class of rational Dyck paths with slope (2m+1)/2 corresponding to factor-free Dyck words, as introduced by P. Duchon. We show that, for the slopes considered in this paper, the language of factor-free Dyck words is generated by…

An alternative to commonly used domain wall fermions is presented. Some rigorous bounds on the condition number of the associated linear problem are derived. On the basis of these bounds and some experimentation it is argued that domain…

Quantum $n$-qubit states that are totally symmetric under the permutation of qubits are essential ingredients of important algorithms and applications in quantum information. Consequently, there is significant interest in developing methods…

Despite extensive research both on the theoretical and practical fronts, formalising, reasoning about, and implementing languages with variable binding is still a daunting endeavour - repetitive boilerplate and the overly complicated…

In this paper we consider the problem of deciding membership in Dyck languages, a fundamental family of context-free languages, comprised of well-balanced strings of parentheses. In this problem we are given a string of length $n$ in the…

The machinery of computing vacuum expectation values of a time-ordered sequence of position operators of the simple harmonic oscillator is already well established. It rests on a Wick theorem, which enables one to decompose such a quantity…

The commutative ambiguity of a context-free grammar G assigns to each Parikh vector v the number of distinct leftmost derivations yielding a word with Parikh vector v. Based on the results on the generalization of Newton's method to…

In this paper we provide a novel and general way to construct the result of the action of any bosonic or fermionic operator represented in second quantized form on a state vector, without resorting to the matrix representation of operators…

The implementation of security protocols often combines different languages. This practice, however, poses a challenge to traditional verification techniques, which typically assume a single-language environment and, therefore, are…

Following [OW16], we continue our analysis of: (1) "Quantum tomography", i.e., learning a quantum state, i.e., the quantum generalization of learning a discrete probability distribution; (2) The distribution of Young diagrams output by the…

Transformer architectures are typically described in algorithmic and statistical terms, leaving their internal mechanics without a familiar structural language for researchers trained in physical theories. To bridge this gap, we develop a…

Density operators allow for representing ambiguity about a vector representation, both in quantum theory and in distributional natural language meaning. Formally equivalently, they allow for discarding part of the description of a composite…