A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the periodicity of regular languages
1979
Information and Control
A subclass of regular languages called periodic languages and the corresponding finite automata having nontrivial periodid, structure are characterized in this paper. Canonical forms of the regular expressions representing such periodic languages are presented. A systematic procedure to determine the periodicity of any given regular expression is devised through a differential approach. Closure properties of periodic languages are found. Relationships between period!c languages and other
doi:10.1016/s0019-9958(79)90394-2
fatcat:bwafmd5vybhghm73zaoiktdfwu