Markovian embeddings of general random strings

DOI10.1137/1.9781611972986.2zbMath1429.68151arXiv0802.1896OpenAlexW1629107725MaRDI QIDQ5194643

Manuel E. Lladser

Publication date: 16 September 2019

Published in: 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0802.1896

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Algorithms on strings (68W32) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Stochastic analysis of minimal automata growth for generalized strings ⋮ Moments of the count of a regular expression in a heterogeneous random sequence ⋮ Approximation of sojourn-times via maximal couplings: motif frequency distributions

This page was built for publication: Markovian embeddings of general random strings