Nie jesteś zalogowany |
Decision Problems for P-finite Sequences
- Prelegent(ci)
- George Kenison
- Afiliacja
- Liverpool John Moores University
- Język referatu
- angielski
- Termin
- 23 lipca 2025 14:15
- Pokój
- p. 5440
- Tytuł w języku polskim
- Decision Problems for P-finite Sequences
- Seminarium
- Seminarium „Teoria automatów”
This talk will discuss the algorithmic analysis of the class of P-finite sequences. These sequences satisfy linear recurrence relations with polynomial coefficients and are common across the quantitative sciences (examples include the Fibonacci, Motzkin, Harmonic, and Catalan numbers). We shall focus on computational aspects and their relevance to basic verification problems, such as termination and reachability. Time permitting, we will give some of the mathematical context for these problems, discuss recent progress, and highlight unsolved cases.
