For bounded automatic actions of inverse semigroups the orbit relation is ω-regular, making first-order statements about orbits and actions decidable, including computability of Fatou component encodings for post-critically finite polynomials.
Richard Büchi, Weak second-order arithmetic and finite automata , Z
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.
citing papers explorer
-
Automatic actions I. Bounded automata and orbits
For bounded automatic actions of inverse semigroups the orbit relation is ω-regular, making first-order statements about orbits and actions decidable, including computability of Fatou component encodings for post-critically finite polynomials.
-
An MSO Framework for Weak-Memory Verification and Robustness
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.