Abstract
This paper is concerned with cycle rank (or, as sometimes called, cycle complexity) of finite transition graphs, a notion which was introduced by Eggan in connection with the notion of star height of regular events. Certain basic types of transformations on transition graphs are introduced and their effect on the cycle rank of the graphs is investigated. It is then shown that any transition graph G can be converted, by a finite series of such transformations, into an equivalent non-deterministic state graph (i.e., transition graph without any empty-word transitions) which has no more nodes than G and no higher cycle rank. A stronger version of Eggan's Star Height Theorem follows.
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.
