Abstract
IfH andG are the transfer function matrix and the free response matrix of a linear finite automaton, thenG is called a free response matrix matched toH. GivenH, letG(H) be the set of all possible free response matrices matched toH. A classification and an enumeration on the setG(H) are given 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.
