invariant matrices
Recently Published Documents


TOTAL DOCUMENTS

31
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)

Author(s):  
I. Papusha

The article presents the description of a complex syntactic whole as the main unit of written communication in the aspect of the efficiency of its use in the texts of the book of functional styles. Special attention is paid to invariant matrices of complex syntactic whole, as the external forms of complex syntactic whole form stable multiple of the identity, and the analysis forms of complex syntactic whole allows to speak about given regularities of production / perception, which is impossible within the scope of a shape.



2020 ◽  
Vol 210 ◽  
pp. 21001
Author(s):  
Irina Papusha

A complex syntactic whole is one of the linguistic units that function in the text. The article discusses structural and semantic indicators that realize indivisibility of expression and content planes, as well as discreteness and specific reproducibility. Special attention is paid to invariant matrices of the external form of a complex syntactic unit, which contribute to the spatial-temporal separateness of a complex syntactic whole in a text and allow to reveal the patterns of its production / perception. The term base of the article is based on the original author's glossary of the research topic.



Filomat ◽  
2019 ◽  
Vol 33 (9) ◽  
pp. 2809-2831
Author(s):  
Stefan Stanimirovic ◽  
Aleksandar Stamenkovic ◽  
Miroslav Ciric

We define right and left invariant matrices as Boolean matrices that are solutions to certain systems of matrix equations and inequalities over additively idempotent semirings. We provide improved algorithms for computing the greatest right and left invariant equivalence and quasi-order matrices. The improvements are based on the usage of the well-known partition refinement technique. Afterwards, we present the application of right invariant matrices in the determinization of weighted automata over additively idempotent, commutative and zero-divisor free semirings. In particular, we provide improvements of the well-known determinization method of weighted automata over tropical semirings given by Mohri [Computational Linguistics 23 (2) (1997) 269-311].



Author(s):  
И. Папуша ◽  
I. Papusha

The article presents the description of a complex syntactic whole as the main unit of written communication in the aspect of the efficiency of its use in the texts of the book of functional styles. Special attention is paid to invariant matrices of complex syntactic whole, as the external forms of complex syntactic whole form stable multiple of the identity, and the analysis forms of complex syntactic whole allows to speak about given regularities of production / perception, which is impossible within the scope of a shape.



2016 ◽  
Vol 109 ◽  
pp. 84-89 ◽  
Author(s):  
Guilong Liu ◽  
Zheng Hua ◽  
Jiyang Zou


2014 ◽  
Vol 126 ◽  
pp. 1-13 ◽  
Author(s):  
Benoît Collins ◽  
Sho Matsumoto ◽  
Nadia Saad


2013 ◽  
Vol 439 (1) ◽  
pp. 196-210 ◽  
Author(s):  
Mahir Bilen Can ◽  
Roger Howe ◽  
Michael Joyce
Keyword(s):  


2012 ◽  
Vol 17 (1) ◽  
pp. 199-212 ◽  
Author(s):  
Yuval Ginosar ◽  
Ofir Schnabel


2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Nicolas M. Thiéry

International audience Let $M$ be a finite monoid. In this paper we describe how the Cartan invariant matrix of the monoid algebra of $M$ over a field $\mathbb{K}$ of characteristic zero can be expressed using characters and some simple combinatorial statistic. In particular, it can be computed efficiently from the composition factors of the left and right class modules of $M$. When $M$ is aperiodic, this approach works in any characteristic, and generalizes to $\mathbb{K}$ a principal ideal domain like $\mathbb{Z}$. When $M$ is $\mathcal{R}$-trivial, we retrieve the formerly known purely combinatorial description of the Cartan matrix. Soit $M$ un monoïde fini. Dans cet article, nous exprimons la matrice des invariants de Cartan de l'algèbre de $M$ sur un corps $\mathbb{K}$ de caractéristique zéro à l'aide de caractères et d'une statistique combinatoire simple. En particulier, elle peut être calculée efficacement à partir des facteurs de compositions des modules de classes à gauche et à droite de $M$. Lorsque $M$ est apériodique, cette approche se généralise à toute caractéristique et aux anneaux principaux comme $\mathbb{Z}$. Lorsque $M$ est $\mathcal{R}$-trivial, nous retrouvons la description combinatoire de la matrice de Cartan précédemment connue.



Sign in / Sign up

Export Citation Format

Share Document