صفة
Involving more than one counter.
الاستعمال- not-comparable
- أمثلة
-
أمثلة إضافية (1)
Surprisingly, the complexity of the problem explodes when we add one binary symbol more: C2 with one linear order and in the presence of other binary predicate symbols is equivalent, under elementary reductions, to the emptiness problem for multicounter automata.