A bijection between a subclass of appending streaming string transducers and bimachines enables Ptime register minimization and NP minimization for states and registers, extended via asynchronous bimachines to prove NP-completeness of register minimization with fixed underlying automaton.
Deshmukh and Mukund Raghothaman and Yifei Yuan , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.FL 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Formalizes the discounted monitoring problem, proves impossibility of exact finite-memory sound monitoring, introduces ε-approximate soundness with memory bounds, extends to stochastic expected discounted sums with optimality results, and provides a specification language evaluated on fairness scena
citing papers explorer
-
Minimizing Streaming String Transducers: An algebraic approach
A bijection between a subclass of appending streaming string transducers and bimachines enables Ptime register minimization and NP minimization for states and registers, extended via asynchronous bimachines to prove NP-completeness of register minimization with fixed underlying automaton.
-
Monitoring Discounted Sum Properties
Formalizes the discounted monitoring problem, proves impossibility of exact finite-memory sound monitoring, introduces ε-approximate soundness with memory bounds, extends to stochastic expected discounted sums with optimality results, and provides a specification language evaluated on fairness scena