FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
From MaRDI portal
Publication:5509691
DOI10.1070/RM1963v018n04ABEH001139zbMath0137.01102MaRDI QIDQ5509691
Publication date: 1963
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Related Items
Über Automatenmodelle in der statistischen Lerntheorie, An exact formula for the move-to-front rule for self-organizing lists, Total variation cutoff for the flip-transpose top with random shuffle, Random motion on finite rings. I: commutative rings, Pioneering approaches for enhancing the speed of hierarchical LA by \textit{ordering} the actions, Markov Chains for Promotion Operators, Limiting behavior of the search cost distribution for the move-to-front rule in the stable case, Unified theory for finite Markov chains, A new class of libraries, Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process, Combinatorial Markov chains on linear extensions, Limiting search cost distribution for the move-to-front rule with random request probabilities, Unnamed Item, Stochastic ranking process with time dependent intensities, Properties of the promotion Markov chain on linear extensions, Unnamed Item, Cancellation of fluctuation in stochastic ranking process with space-time dependent intensities, [https://portal.mardi4nfdi.de/wiki/Publication:3908273 R�currence positive des librairies mixtes], Lumpings of algebraic Markov chains arise from subquotients, Multiplicities of eigenvalues of some linear search schemes, Perron eigenvector of the Tsetlin matrix
