Search

• < Previous
• 1
• Next >

---

Descriptive Complexity for Counting Complexity Classes

Marcelo Arenas ; Martin Muñoz ; Cristian Riveros.

Descriptive Complexity has been very successful in characterizing complexity classes of decision problems in terms of the properties definable in some logics. However, descriptive complexity for counting complexity classes, such as FP and #P, has not been systematically studied, and it is not as&nbsp;[&hellip;]

---

Pumping lemmas for weighted automata

Agnishom Chattopadhyay ; Filip Mazowiecki ; Anca Muscholl ; Cristian Riveros.

We present pumping lemmas for five classes of functions definable by fragments of weighted automata over the min-plus semiring, the max-plus semiring and the semiring of natural numbers. As a corollary we show that the hierarchy of functions definable by unambiguous, finitely-ambiguous,&nbsp;[&hellip;]

---