Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs
From MaRDI portal
Publication:426739
zbMath1243.05212MaRDI QIDQ426739
Stephen M. Shea, Andrew Lazowski
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p1
directed graphBell numbersMarkovBernoulli schemedistinguishing numberfinitarily Markovianvariable-length Markov
Stationary stochastic processes (60G10) Bell and Stirling numbers (11B73) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Distinguishing numbers and distinguishing indices of oriented graphs ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
Uses Software
This page was built for publication: Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs
