Abstract
We present here a package of Macsyma programs, allowing the manipulation of words, and noncommutative power series over a finite alphabet. On the basis of the works of Fliess and Reutenauer concerning the local minimal realization of analytical systems, we present an algorithm allowing the computation of the local minimal realization of finite generating power series. We describe that algorithm in the algebraic computation language, Macsyma.
Sign-in/Register to access full text options 
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.
