Abstract
Today Finite Automata are used in several areas of economy and research, for example in language and text processing or E-Commerce. There are often automata with more than hundred thousand states. Minimization of such automata can only be done by classical minimization methods. But this doesnt produce Minimal Finite Automata with output. A Transducer is a special Finite Automata that produces an output. One of the challenges is to test the equivalence of Transducers, this will be shown in this paper.
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.
