Abstract
The paper deals with a class of programs called deterministic Mazurkiewicz algorithms. It considers languages associated with such algorithms by using symbols instead of actual relations and concatenation of words rather than composition of actual relations. It is shown that the class of languages so generated is precisely the class of simple context-free languages of Korenjak and Hoperoft [8].
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.
