$$A = \{a^{2j+3}b^{k+r+4}c^{2s+3} \mid j \geq k \geq 0, r \geq 0, s \geq 0\}$$
I'm assuming this is a regural language even though $k$ depends on $j$ because the amount of $a$'s has no correlation to the amount of $b$'s due to the $r$ term added into the exponent of $b$. Do you guys agree with this assumption?
Thank you. I'm new to the site I'm not sure if my syntax is perfect with the formula, sorry about that.
Hint. Show that your language is equal to $$a^3(a^2)^*b^*b^4(c^2)^*c^3$$ and hence is regular.