Abstract
Restrictions of reversal-bounded multicounter machines are studied; in particular, those that cannot subtract from any counter until it has reached the end of the input. It is proven that this does not alter the languages accepted when the machines are nondeterministic. When the machines are deterministic, the languages (denoted by eDCM) are shown to coincide with those accepted by deterministic Parikh automata, but are strictly contained in the class of languages accepted by machines without this condition. It then follows that all commutative semilinear languages are in this restricted class. A number of decidability and complexity properties are shown, such as the ability to test, given a deterministic pushdown automaton (even if augmented by a fixed number of reversal-bounded counters), whether it is commutative. Lastly, this deterministic family, eDCM, is shown to be the smallest family of languages closed under commutative closure, right quotient with regular languages and inverse deterministic finite transductions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
