作者: Michaël Cadilhac , Andreas Krebs , Pierre McKenzie
DOI: 10.1007/978-3-642-40663-8_7
关键词:
摘要: The Parikh automaton model equips a finite with integer registers and imposes semilinear constraint on the set of their final settings. Here theory typed monoids is used to characterize language classes that arise algebraically. Complexity bounds are derived, such as containment unambiguous automata languages in NC1. Noting DetAPA positive supports rational ℤ-series, further shown stronger than unary langages. This suggests candidates for separating two better known variants uniform