… constrained automaton (CA), which is equivalent to the PA, and the affine Parikh automaton
(… Section 4 shows that the class of bounded languages recognized by PA is BSL. Section 5 …

… Klaedtke and Rueß [18] showed Parikh automata to be expressively … -bounded counter
machines [18], in which counters can go from decrementing to incrementing only a bounded …

… . For a given class of languages, we say that it is Parikh-bounded if for any L in the class
there exists a bounded language L in the class with L ⊆ L and Φ(L) = Φ(L ). This property is …

… , and then we apply a PSpace algorithm performing on-the-fly the one-way transformation
up to some bounded length. Finally, the emptiness problem for the intersection of n PA was …

… The central result in this paper is that if L is context-free it is also Parikh-bounded. Parikh's
theorem follows as a corollary. If L is not bounded but is a Parikh-bounded language closed …

… applying Parikh’s Theorem from classical automata theory to symbolic automata yields …
In this paper, we provide a new construction for Parikh’s Theorem for symbolic automata and …

… is a bounded language L⊆ L which has the same Parikh (… linear substitutions that preserve
the Parikh image of the context … state space of counter automata with context-free constraints. …

… bounded by |𝑄2| and we can compute automata for these languages in polynomial time).
The idea for the proof of the lemma is as follows. Suppose 𝑆𝑅𝜔 (A1) ∩ 𝑅𝑅𝜔 (A2) ≠ ∅ and let …

… We note that deterministic PA are strictly weaker than deterministic reversal-bounded
counter machines. We develop pumping-style lemmas and identify an explicit PA language …

… intended Parikh automaton A′ accepting L′, using A as a black box. The main idea is that
A′ simulates A, but along the accepting runs in A′, the counter is only used in a bounded …