Abstract
In this paper we exhibit two different effective constructions of the syntactic algebra U s associated with a recognizable tree series S. In order to make the first construction we only need a natural number n satisfying dim U s⩽n . The second way to obtain U s is by minimization of a given realization of S. We finally describe (effectively) a minimal matrix representation of S.
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.
