The Myhill-Nerode Theorem for Bounded Interaction: Canonical Abstractions via Agent-Bounded Indistinguishability
Anthony T. Nixon

TL;DR
This paper generalizes the Myhill-Nerode theorem to bounded interaction scenarios in POMDPs, introducing a canonical quotient that captures indistinguishability under capacity limits, with practical experiments validating its properties.
Contribution
It formalizes a Myhill-Nerode type theorem for bounded agents in POMDPs, defining a canonical, minimal quotient that characterizes agent indistinguishability and decision sufficiency.
Findings
The quotient is canonical, minimal, and unique.
Clock-aware probes achieve decision-sufficiency for certain objectives.
Empirical validation on Tiger and GridWorld supports theoretical claims.
Abstract
Any capacity-limited observer induces a canonical quotient on its environment: two situations that no bounded agent can distinguish are, for that agent, the same. We formalise this for finite POMDPs. A fixed probe family of finite-state controllers induces a closed-loop Wasserstein pseudometric on observation histories and a probe-exact quotient merging histories that no controller in the family can distinguish. The quotient is canonical, minimal, and unique-a bounded-interaction analogue of the Myhill-Nerode theorem. For clock-aware probes, it is exactly decision-sufficient for objectives that depend only on the agent's observations and actions; for latent-state rewards, we use an observation-Lipschitz approximation bound. The main theorem object is the clock-aware quotient; scalable deterministic-stationary experiments study a tractable coarsening with gap measured on small exact…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity and Verification in Computing · Formal Methods in Verification · Free Will and Agency
