Codes and noncommutative stochastic matrices
DOI10.4171/JNCG/65zbMath1202.15036MaRDI QIDQ1959746
Vladimir S. Retakh, Dominique Perrin, Christophe Reutenauer, Sylvain Lavallée
Publication date: 7 October 2010
Published in: Journal of Noncommutative Geometry (Search for Journal in Brave)
digraphautomataeigenvectorsdivision ringsprefix codesskew fieldsfree monoidquasi-determinantsnoncommutative stochastic matrices
Determinants, permanents, traces, other special matrix functions (15A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Semigroups in automata theory, linguistics, etc. (20M35) Stochastic matrices (15B51) Prefix, length-variable, comma-free codes (94A45) Skew fields, division rings (12E15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unambiguous automata
- Quasideterminants. I
- Matrix tree theorems
- A theory of noncommutative determinants and characteristic functions of graphs
- Quasideterminants
- Determinants of matrices over noncommutative rings
- A proof of the Markov chain tree theorem
- Exact mixing in an unknown Markov chain
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- From Hermite rings to Sylvester domains
This page was built for publication: Codes and noncommutative stochastic matrices