Skolem and positivity completeness of ergodic Markov chains
type: Item
instance of: scholarly article
title: Skolem and positivity completeness of ergodic Markov chains
zbMATH Open document ID: 1541.68228
author: Mihir Vahanwala
published in: Information Processing Letters
publication date: 2024-06-07T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 7861406
zbMATH Keywords: formal methods
zbMATH Keywords: ergodic Markov chains
zbMATH Keywords: reachability
zbMATH Keywords: model checking
zbMATH Keywords: linear recurrence sequences
MaRDI profile type: Publication
cites work: Q5322945
cites work: Approximate Verification of the Symbolic Dynamics of Markov Chains
cites work: A Logic of Probability with Decidable Model Checking
cites work: Positivity Problems for Low-Order Linear Recurrence Sequences
cites work: Q3671245
cites work: Skolem meets schanuel
cites work: Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
cites work: On the Positivity Problem for Simple Linear Recurrence Sequences,
cites work: Generalized Automata and Stochastic Languages
cites work: Reachability problems for Markov chains
cites work: MDPs as distribution transformers: affine invariant synthesis for safety objectives
cites work: Einige Sätze über \(p\)-adische Potenzreihen mit Anwendung auf gewisse exponentielle Gleichungen.
cites work: Reprint: An arithmetic property of Taylor coefficients of rational functions (1935)
cites work: A note on recurring series
cites work: Deux propriétés décidables des suites récurrentes linéaires
cites work: Q4421931
cites work: Nonparametric statistics for stochastic processes
DOI: 10.1016/J.IPL.2024.106481
description: scientific article; zbMATH DE number 7861406