Search

• < Previous
• 1
• Next >

---

Tameness and the power of programs over monoids in DA

Nathan Grosshans ; Pierre Mckenzie ; Luc Segoufin.

The program-over-monoid model of computation originates with Barrington's proof that the model captures the complexity class $\mathsf{NC^1}$. Here we make progress in understanding the subtleties of the model. First, we identify a new tameness condition on a class of monoids that entails a natural&nbsp;[&hellip;]

---

Well Behaved Transition Systems

Michael Blondin ; Alain Finkel ; Pierre McKenzie.

The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem. We show coverability decidable for monotone&nbsp;[&hellip;]

---