Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond.

Bell, Paul C, Potapov, Igor and Semukhin, Pavel (2019) Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019-8-26 - 2019-8-30, Aachen, Germany.

Access the full-text of this item by clicking on the Open Access link.

Item Type:	Conference or Workshop Item (Unspecified)
Depositing User:	Symplectic Admin
Date Deposited:	21 Aug 2019 14:59
Last Modified:	19 Jan 2023 00:28
DOI:	10.4230/LIPIcs.MFCS.2019.83
Open Access URL:	http://drops.dagstuhl.de/opus/volltexte/2019/11027...
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3052303