Classifying rotationally-closed languages having greedy universal cycles
From MaRDI portal
Publication:1732029
zbMath1409.68352arXiv1805.11641MaRDI QIDQ1732029
Publication date: 15 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.11641
Cites Work
This page was built for publication: Classifying rotationally-closed languages having greedy universal cycles