Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation

Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation

Show other versions (1)

Analysis of Algorithms

Bibliographic Details
Main Authors:	Philippe Dumas, Helger Lipmaa, Johan Wallén
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2007-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/399/pdf

Similar Items

Asymptotic results for silent elimination
by: Guy Louchard, et al.
Published: (2010-01-01)

Determinants of rational knots
by: Louis H. Kauffman, et al.
Published: (2009-01-01)

Asymptotic enumeration on self-similar graphs with two boundary vertices
by: Elmar Teufl, et al.
Published: (2009-01-01)

Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
by: Vera Koponen
Published: (2012-11-01)

On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)

A combinatorial non-commutative Hopf algebra of graphs
by: Adrian Tanasa, et al.
Published: (2014-06-01)

Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''
by: Véronique Bruyère, et al.
Published: (2007-01-01)

Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)

A lower bound for approximating the Grundy number
by: Guy Kortsarz
Published: (2007-01-01)

Baire and automata
by: Pierre Simonnet, et al.
Published: (2007-01-01)

FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees
by: Pascale Minet, et al.
Published: (2007-01-01)

On the kth Eigenvalues of Trees with Perfect Matchings
by: An Chang, et al.
Published: (2007-01-01)

On the critical exponent of generalized Thue-Morse words
by: Alexandre B. Massé, et al.
Published: (2007-01-01)

Properties of the extremal infinite smooth words
by: Srečko Brlek, et al.
Published: (2007-01-01)

"Trivializing'' generalizations of some Izergin-Korepin-type determinants
by: Tewodros Amdeberhan, et al.
Published: (2007-01-01)

Waiting time distributions for pattern occurrence in a constrained sequence
by: Valeri T. Stefanov, et al.
Published: (2007-01-01)

Approximation and inapproximability results on balanced connected partitions of graphs
by: Frédéric Chataigner, et al.
Published: (2007-01-01)

Probe split graphs
by: Van Bang Le, et al.
Published: (2007-01-01)

Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)

Arithmetics in β-numeration
by: Julien Bernat
Published: (2007-01-01)

Complexity results on graphs with few cliques
by: Bill Rosgen, et al.
Published: (2007-01-01)

A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations
by: Guy Louchard, et al.
Published: (2007-01-01)

Addition and multiplication of beta-expansions in generalized Tribonacci base
by: Petr Ambrož, et al.
Published: (2007-01-01)

Exponential bounds and tails for additive random recursive sequences
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

A geometrical approach of palindromic factors of standard billiard words
by: Jean-Pierre Borel
Published: (2007-01-01)

Computation of L_⊕ for several cubic Pisot numbers
by: Julien Bernat
Published: (2007-01-01)

On the complexity of the balanced vertex ordering problem
by: Jan Kára, et al.
Published: (2007-01-01)

Regular languages and associative language descriptions
by: Marcella Anselmo, et al.
Published: (2007-01-01)

Tribes of cubic partial cubes
by: Sandi Klavžar, et al.
Published: (2007-01-01)

A perimeter enumeration of column-convex polyominoes
by: Svjetlan Feretić
Published: (2007-01-01)

Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)

The \v Cerný conjecture for aperiodic automata
by: A. N. Trahtman
Published: (2007-01-01)

Latin square Thue-Morse sequences are overlap-free
by: C. Robinson Tompkins
Published: (2007-01-01)

On the tileability of polygons with colored dominoes
by: Chris Worman, et al.
Published: (2007-01-01)

Independent sets in graphs with an excluded clique minor
by: David R. Wood
Published: (2007-01-01)

Words and bisimulations of dynamical systems
by: Thomas Brihaye
Published: (2007-01-01)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)