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.
–o′ is defined, for allu∈Σ ∗ andσ∈Σ, by(q ′ 0 ·A′ u)∗ T ′ σ= (q 0 ·A u)∗ T σif (q0 ·A u)∗ T σis defined and(q ′ 0 ·A′ u)∗ T ′ σ=σotherwise
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.