Filters








144 Hits in 2.2 sec

Page 9546 of Mathematical Reviews Vol. , Issue 2003m [page]

2003 Mathematical Reviews  
Summary: “We introduce a new Kleene star operation. Linear languages with a nonassociative concatenation can then be denoted by regular-like expressions using this Kleene star operation.  ...  Our construction uses an alphabet of size 5.” 2003m:68075 68Q45 Germain, Christian (F-DJON-II; Dijon) ; Pallo, Jean (F-DJON-II; Dijon) Linear languages with a nonassociative concatenation.  ... 

Page 1271 of Mathematical Reviews Vol. , Issue 2001B [page]

2001 Mathematical Reviews  
(English and French summaries) [Rational languages with a nonassociative concatenation] Theoret. Comput. Sci. 233 (2000), no. 1-2, 217-231.  ...  This paper extends the power-series approach to the theory of rational languages to free objects with a nonassociative operation.  ... 

Page 3365 of Mathematical Reviews Vol. , Issue 84h [page]

1984 Mathematical Reviews  
It is known that the regular languages and, in particular, the expansion into formal power series of left-linear systems are defined on a monoid with a noncommutative variable and an associative concatenation  ...  The present paper generalizes this theory using a nonassociative structure. Two families of regular languages are obtained, depending on left or right linearity of the system.  ... 

Free braided nonassociative Hopf algebras and Sabinin τ-algebras [article]

Ualbai Umirbaev, Vladislav Kharchenko
2020 arXiv   pre-print
Let V be a linear space over a field k with a braiding τ : V⊗ V→ V⊗ V.  ...  We introduce a braided version of Sabinin algebras and prove that the set of all primitive elements of a nonassociative τ-algebra is a Sabinin τ-algebra.  ...  This algebra is isomorphic to the tensor algebra T (V ) = ∞ i=0 V ⊗i of the linear space V with the concatenation product.  ... 
arXiv:2001.00304v1 fatcat:pumntyh63ja7jgybofksdoxnvi

Jordan algebras arising from intermolecular recombination

Murray R. Bremner
2005 ACM SIGSAM Bulletin  
We use computer algebra to show that a linearization of the operation of intermolecular recombination from theoretical genetics satisfies a nonassociative polynomial identity of degree 4 which implies  ...  Sehgal for information about representations of the symmetric group, and NSERC (the Natural Sciences and Engineering Research Council of Canada) for financial support through a Discovery Grant.  ...  Let M (S) be the free monoid on S; that is, the set of all finite words a = a 1 · · · a where a k ∈ S for k = 1, . . . , , with concatenation as the associative binary operation.  ... 
doi:10.1145/1140378.1140380 fatcat:q7mx3a7tl5au3dc5xg3w42ysbm

Page 2508 of Mathematical Reviews Vol. , Issue 90D [page]

1990 Mathematical Reviews  
concatenated codes (pp. 89-98); Cynthia A.  ...  Piacentini Cattaneo, Nonassociative degree five identities not implied by commutativity: a computer approach (pp. 336-340); J. Rifa, J. M. Basart and L.  ... 

Declarative Composition of Stack Frames [chapter]

Christian Lindig, Norman Ramsey
2004 Lecture Notes in Computer Science  
When a compiler translates a procedure, it must lay out the procedure's stack frame in a way that respects the calling convention.  ...  We have concentrated the implementation of layout into a single, unifying abstraction: the block. The block abstraction decouples layout from slot allocation.  ...  Acknowledgements This work has been supported by NSF grants CCR-0096069 and ITR-0325460 and by a gift from Microsoft Research.  ... 
doi:10.1007/978-3-540-24723-4_20 fatcat:4etwgn4ezfcwvlzohp2kitopoe

Graded Algebras, Algebraic Functions, Planar Trees, and Elliptic Integrals [article]

Vesselin Drensky
2020 arXiv   pre-print
We give simple constructions of finitely generated graded associative algebras R with Hilbert series H(R,t) very close to an arbitrary power series a(t) with exponentially bounded nonnegative integer coefficients  ...  Then we summarize some related facts on algebras with polynomial identity. Further we discuss the problem how to find series a(t) which are rational/algebraic/transcendental over Q(t).  ...  Equivalently, its coefficients a n satisfy a linear recurrence with coefficients which are polynomials in n.  ... 
arXiv:2004.05596v1 fatcat:id7cek3zefb7vdk7k5fpa275ja

Type Logics in Grammar [chapter]

W. Buszkowski
2003 Trends in Logic  
Nonassociative Lambek Calculus (NL) deals with sequents X A such that X is a type structure and A is a type.  ...  Take M = T + with concatenation. We write Γ T A if there exists a proof of Γ A in AL(Φ) which consists of T −sequents only (see the end of subsection 3.1).  ... 
doi:10.1007/978-94-017-3598-8_12 fatcat:mfpscmkdffhkzkzvuju4uj3qxa

On Classical Nonassociative Lambek Calculus [chapter]

Wojciech Buszkowski
2016 Lecture Notes in Computer Science  
We prove that CNL is a strongly conservative extension of NL, CNL has the strong finite model property, the grammars based on CNL (also with assumptions) generate the context-free languages, and the finitary  ...  CNL, intoduced by de Groote and Lamarche [11] , is a conservative extension of Nonassociative Lambek Calculus (NL) by a De Morgan negation ∼ , satisfying A ∼ /B ⇔ A\B ∼ . [11] provides a fine theory of  ...  Therefore the former may also be useful in the theory of associative linear logics with no multiplicative units (not only in language, but in the corresponding algebras). Clearly (COM-O) (resp.  ... 
doi:10.1007/978-3-662-53826-5_5 fatcat:m2cyh7ceubdglimkevlmr3m3pq

Kolmogorov Complexity, Causality And Spin [article]

Dara O. Shayda
2012 arXiv   pre-print
Motion under the electromagnetic field described with immediate relationship with Subscript[G, 2] Holonomy group and its corresponding dense free 2-subgroup.  ...  Consequently, the physical laws are nothing but a low-pass filter for small values of Kolmogorov Complexity.  ...  This formulation is free of ideas about particle anti-particle, it is all about reversing a word in a language. 5.  ... 
arXiv:1204.5447v2 fatcat:soou4c5dczbxrek5mlxkl7q32a

Groupoid Quantization of Loop Spaces [article]

Christian Saemann, Richard J. Szabo
2012 arXiv   pre-print
We then discuss how the quantization of a 2-plectic manifold can be reduced to ordinary quantization of its loop space, which is a symplectic manifold.  ...  The work of CS was supported by a Career Acceleration Fellowship from the UK Engineering and Physical Sciences Research Council.  ...  The linearized nonassociativity structure is encoded in the brackets [x 2 , x 3 ] ∼ p 1 and [x 1 , x 2 , x 3 ] = 0 . (2.15) This nonassociative algebra may be regarded as a C * -algebra in a monoidal category  ... 
arXiv:1203.5921v1 fatcat:yfnymgl6unh3tjzpnunaq3zyem

Lie-Butcher series, Geometry, Algebra and Computation [article]

Hans Z. Munthe-Kaas, Kristoffer K. Føllesdal
2017 arXiv   pre-print
This is part of an ongoing effort to create an extensive software library for computations in LB-series and B-series in the programming language Haskell.  ...  First, we aim at presenting the algebraic structures underlying LB series in a concise and self contained manner.  ...  Then k C = {k (C * ) , ·}, is the vector space containing finite linear combinations of empty and non-empty words, equipped with a product · which on words is concatenation.  ... 
arXiv:1701.03654v2 fatcat:eqeitpijofbazf7syxdkjwacci

Classical linear logic, cobordisms and categorical semantics of categorial grammars [article]

Sergey Slavnov
2019 arXiv   pre-print
However, constituents of linear logic grammars (LLG) are not abstract λ-terms, but simply tuples of words with labeled endpoints, we call them multiwords.  ...  This category is symmetric monoidal closed and compact closed and thus is a model of linear λ-calculus and classical linear logic. We think that this category is interesting on its own right.  ...  We represent finite sequences of integers as words in the alphabet T = {+, −, •}, with • interpreted as a separation sign.  ... 
arXiv:1810.02047v6 fatcat:i4cob3ttyjgxhl5w6i4zu7nlvq

On the Poset of Computation Rules for Nonassociative Calculus

Miguel Couceiro, Michel Grabisch
2012 Order  
This fact asks for systematic ways of parenthesing (or bracketing) terms of a sequence (with more than two arguments) when using such an extended maximum.  ...  In this paper we present a study of this quasi-ordering of computation rules.  ...  Since 0 is the neutral element of , we deal with sequences (words) built on Z =C \ {0}, including the empty sequence ε. Hence, we consider the language L(Z).  ... 
doi:10.1007/s11083-011-9243-z fatcat:hohqszm5uvc57d4ofauyslyere
« Previous Showing results 1 — 15 out of 144 results