Abstract
Let L \(\subseteq\) Aω be an ω-regular language given by means of a non-deterministic Buchi automaton M. Let f,g: A∞ → B∞ be two morphisms. We give an algorithm to decide whether f and g are equivalent (word by word) on L. This algorithm has time complexity 0(mn3), where n is the number of arcs of M and m is the size of f and g. This result improves the only known algorithm for this problem which is exponential time [3].
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.
