Open Problems in Automata Theory

Contributions from the Autobóz Community

Menu Close

Home
Archives
Categories
Tags
About
autóboz website

2022

Sep 16, 2022

22.16 Is Markov reachability problem Skolem-Hard for Ergodic Markov chains?

Search for:

Connect With Us

Recent Posts

24.19 Reachability in Reversible Data VASS
July 14, 2024
24.17 Monotone regular functions
July 13, 2024
24.18 Lower bounds for determinizability of weighted automata over \(\mathbb Q\)
July 13, 2024
24.16 Speed of victory in adversarial population games
July 12, 2024
24.15 Games under delays and loss
July 11, 2024
24.6 Emptiness-checking for 3-clock Timed Automata with additive constraints
July 5, 2024

Tags

Tag Cloud

CFL Games on graphs Kleene algebra Markov chains Nash equilibria Petri nets Petri nets with data Skolem problem VASS XML algebra automata bi-reachablility channels circuits communicating automata complexity context-free grammars continuity cost register automata counter machines coverability descriptional complexity distributed networks emptiness checking first-order logic fixpoint game games graphs infinite words invariants languages linear dynamical systems logic markov decision processes networks neural networks parameterized games parameterized verification parity games peacewise-testable languages petri nets population protocols positionality pushdown pushdown automata pvass reachability separation session types stochastic processes string constraints subtyping temporal logic timed automata transducers trees two variables valence systems vass verification weighted automata

Archives

July 202417
June 20242
April 20243
September 20231
August 20231
July 20231
September 202218
November 20204
August 20201
July 20207
July 201916

© 2024 Open Problems in Automata Theory All Rights Reserved.

Theme by hipaper