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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Every generalized Bratteli diagram is isomorphic to an irreducible version, with new notions of complete irreducibility linked to topological properties of the path space and tail equivalence.
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.
-
Isomoprhism of generalized Bratteli diagrams
Every generalized Bratteli diagram is isomorphic to an irreducible version, with new notions of complete irreducibility linked to topological properties of the path space and tail equivalence.