Abstract
The notion of strong [Formula: see text]-equivalence was introduced as an order-independent alternative to [Formula: see text]-equivalence for Parikh matrices. This paper further studies the notions of [Formula: see text]-equivalence and strong [Formula: see text]-equivalence. Certain structural properties of [Formula: see text]-equivalent ternary words are presented and then employed to (partially) characterize pairs of ternary words that are ME-equivalent (i.e. obtainable from one another by certain elementary transformations). Finally, a sound rewriting system in determining strong [Formula: see text]-equivalence is obtained for the ternary alphabet.
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 callMore From: International Journal of Foundations of Computer Science
Disclaimer: 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.
