论文信息 - The loop complexity of regular events

The loop complexity of regular events

L. C. Eggan defined the ''star height'' of a regular expression in 1963. The present paper continues Eggan's investigation by showing how to reduce certain regular expressions to regular expressions representing the same set but with smaller star height, and also by showing that certain other regular expressions cannot be so reduced.

Robert McNaughton | R. McNaughton

[1] S C Kleene,et al. Representation of Events in Nerve Nets and Finite Automata , 1951 .

[2] George A. Miller,et al. Finite State Languages , 1958, Inf. Control..

[3] R. McNaughton. Techniques for Manipulating Regular Expressions , 1967 .

[4] Janusz A. Brzozowski,et al. On the Star Height of Regular Events , 1967, SWAT.

[5] Robert McNaughton,et al. The Loop Complexity of Pure-Group Events , 1967, Inf. Control..

[6] Marcel Paul Schützenberger,et al. On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..

[7] Robert McNaughton,et al. Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[8] Rina S. Cohen. Cycle rank of transition graphs and the star height of regular events. , 1968 .

[9] L. Eggan. Transition graphs and the star-height of regular events. , 1963 .

[10] Marcel Paul Schützenberger,et al. On a Question of Eggan , 1966, Inf. Control..