A4 Refereed article in a conference publication

Reachability in Linear Recurrence Automata




AuthorsHirvensalo, Mika; Kawamura, Akitoshi; Potapov, Igor; Yuyama, Takao

EditorsKovács, Laura; Sokolova, Ana

Conference nameInternational Conference on Reachability Problems

PublisherSpringer Nature Switzerland

Publication year2024

JournalLecture Notes in Computer Science

Book title Reachability Problems : 18th International Conference, RP 2024, Vienna, Austria, September 25–27, 2024, Proceedings

Issue15050

First page 167

Last page183

ISBN978-3-031-72620-0

eISBN978-3-031-72621-7

ISSN0302-9743

eISSN1611-3349

DOIhttps://doi.org/10.1007/978-3-031-72621-7_12

Web address http://doi.org/10.1007/978-3-031-72621-7_12


Abstract

This paper studies the linear recurrence automata model in which multiple linear recurrences can be used to generate sequences of numbers. We parameterised the model by varying several structural properties to identify under which constraints or extensions the reachability problems become computationally hard and undecidable. We show first the reduction of classical matrix semigroup problems to reachability in linear recurrence automata and then analyse several variants of the model restricting the state structures, the number and the depth of recurrences.



Last updated on 2025-27-01 at 19:15