A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
Crossref DOI link: https://doi.org/10.1007/s10801-018-0851-1
Published Online: 2018-10-24
Published Print: 2019-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Rodaro, Emanuele http://orcid.org/0000-0002-1177-0372
Text and Data Mining valid from 2018-10-24
Version of Record valid from 2018-10-24
Article History
Received: 21 November 2017
Accepted: 30 September 2018
First Online: 24 October 2018
Free to read: This content has been made available to all.