scholarly journals The inference of tree languages from finite samples: an algebraic approach

1994 ◽  
Vol 129 (2) ◽  
pp. 337-367 ◽  
Author(s):  
Timo Knuutila ◽  
Magnus Steinby
Keyword(s):  
Algebraic Approach ◽  
Finite Samples ◽  
Tree Languages

The partial clone of linear tree languages

2017 ◽  
Vol 60 (3) ◽  
pp. 640-654
Author(s):  
N. Lekkoksung ◽  
K. Denecke
Keyword(s):  
Partial Clone ◽  
Tree Languages

Multilevel Algebraic Approach for Performance Analysis of Parallel Algorithms

2019 ◽  
Vol 38 (4) ◽  
pp. 817-850 ◽  
Author(s):  
Luisa D'Amore ◽  
Valeria Mele ◽  
Diego Romano ◽  
Giuliano Laccetti
Keyword(s):  
Performance Analysis ◽  
Parallel Algorithms ◽  
Algebraic Approach

scholarly journals Lie-Algebraic Approach for Pricing Zero-Coupon Bonds in Single-Factor Interest Rate Models

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
C. F. Lo
Keyword(s):  
Interest Rate ◽  
Algebraic Approach ◽  
Dynamical Symmetry ◽  
Bond Pricing ◽  
Model Parameters ◽  
Time Varying ◽  
Single Factor ◽  
Bond Price ◽  
Interest Rate Models ◽  
Root Model

The Lie-algebraic approach has been applied to solve the bond pricing problem in single-factor interest rate models. Four of the popular single-factor models, namely, the Vasicek model, Cox-Ingersoll-Ross model, double square-root model, and Ahn-Gao model, are investigated. By exploiting the dynamical symmetry of their bond pricing equations, analytical closed-form pricing formulae can be derived in a straightfoward manner. Time-varying model parameters could also be incorporated into the derivation of the bond price formulae, and this has the added advantage of allowing yield curves to be fitted. Furthermore, the Lie-algebraic approach can be easily extended to formulate new analytically tractable single-factor interest rate models.

Tree Rewriting Systems, Combinatory Weak Reduction Systems and Type Free Languages1

1982 ◽  
Vol 5 (3-4) ◽  
pp. 279-299
Author(s):  
Alberto Pettorossi
Keyword(s):  
Combinatory Logic ◽  
Rewriting Systems ◽  
Tree Transducers ◽  
Tree Languages ◽  
One To One ◽  
The One ◽  
Weak Reduction

In this paper we consider combinators as tree transducers: this approach is based on the one-to-one correspondence between terms of Combinatory Logic and trees, and on the fact that combinators may be considered as transformers of terms. Since combinators are terms themselves, we will deal with trees as objects to be transformed and tree transformers as well. Methods for defining and studying tree rewriting systems inside Combinatory Weak Reduction Systems and Weak Combinatory Logic are also analyzed and particular attention is devoted to the problem of finiteness and infinity of the generated tree languages (here defined). This implies the study of the termination of the rewriting process (i.e. reduction) for combinators.

scholarly journals Target space entanglement in quantum mechanics of fermions and matrices

2021 ◽  
Vol 2021 (8) ◽  
Author(s):  
Sotaro Sugishita
Keyword(s):  
Mutual Information ◽  
Ground State ◽  
Entanglement Entropy ◽  
Algebraic Approach ◽  
Upper Bounds ◽  
Wave Functions ◽  
Target Space ◽  
Single Interval ◽  
Area Law ◽  
Formula Expression

Abstract We consider entanglement of first-quantized identical particles by adopting an algebraic approach. In particular, we investigate fermions whose wave functions are given by the Slater determinants, as for singlet sectors of one-matrix models. We show that the upper bounds of the general Rényi entropies are N log 2 for N particles or an N × N matrix. We compute the target space entanglement entropy and the mutual information in a free one-matrix model. We confirm the area law: the single-interval entropy for the ground state scales as $$ \frac{1}{3} $$ 1 3 log N in the large N model. We obtain an analytical $$ \mathcal{O}\left({N}^0\right) $$ O N 0 expression of the mutual information for two intervals in the large N expansion.

Sign in / Sign up

Export Citation Format

Share Document