Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
Let V be a 3-dimensional vector space over a finite field. We show that any irreducible subgroup of GL(V ) that arises as the automorphism group of an regular polytope preserves a...
: We investigate weighted automata with discounting and their behaviours over semirings and finitely generated graded monoids. We characterize the discounted behaviours of weighted...
We propose a calculus of local equations over one-way measurement patterns [1], which preserves interpretations, and allows the rewriting of any pattern to a standard form where e...