New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
Probabilistic automata of bounded ambiguity
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
Provides a complete characterization of epimorphisms for universal hypergraphic automata via conditions on maps of state and output hypergraphs, after defining weak and strong epimorphisms that agree on p*-hypergraphs.
citing papers explorer
-
Algorithms and fine-grained complexity for nondeterministic and symmetric difference automata
New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
-
On Epimorphisms of Hypergraphic Automata and Input Symbol Semigroups
Provides a complete characterization of epimorphisms for universal hypergraphic automata via conditions on maps of state and output hypergraphs, after defining weak and strong epimorphisms that agree on p*-hypergraphs.