A Note on Cycle Grammars
暂无分享,去创建一个
Grammars whose languages consist of cycles (“necklaces”) rather than strings are considered. If G is context free, and we regard G as generating cycles instead of strings, the resulting language is just what we would get if we “bent” the strings of L ( G ) into cycles. This is no longer true if G is context sensitive. However, in this case too, the context-sensitive cycle languages are just the “bendings” of the context-sensitive string languages. Automata on cyclic tapes are also discussed.
[1] R S LEDLEY,et al. HIGH-SPEED AUTOMATIC ANALYSIS OF BIOMEDICAL PICTURES. , 1964, Science.
[2] King-Sun Fu,et al. Stochastic syntactic analysis for programmed grammars and syntactic pattern recognition , 1972, Comput. Graph. Image Process..