Abstract
We will discuss several recently developed techniques for proving the decidability of the equivalence problem for devices defining languages and relations. Most of these techniques come from the development originated in the proof of the decidability of the DOL equivalence problem. Of particular importance is the recently shown validity of the Ehrenfeucht conjecture and its effective variants.KeywordsEquivalence ProblemFinite AutomatonFinite SystemInput WordInput AlphabetThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
