Computational complexity of problems for deterministic presentations of sofic shifts

From MaRDI portal
Publication:2087461

DOI10.1016/J.TCS.2022.09.017OpenAlexW4226329059MaRDI QIDQ2087461FDOQ2087461


Authors: Justin Cai, Rafael Frongillo Edit this on Wikidata


Publication date: 21 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Computational complexity of problems for deterministic presentations of sofic shifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2087461)