Year-end Sale % OFF 
Abstract
A general method for applying techniques from the theory of automata to enumeration problems is developed, and several applications are given. These include the enumeration of reduced words in a finite group action and a new proof of the MacMahon Master Theorem.
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.
