论文信息 - Slender 0L Languages

Slender 0L Languages

Abstract We present a classification of slender 0L languages into four classes and give decision methods for two of the classes. Open problems are mentioned, as well as interconnections to other areas.

Arto Salomaa | Taishin Y. Nishida | A. Salomaa | T. Nishida

[1] Grzegorz Rozenberg,et al. Cornerstones of undecidability , 1994, Prentice Hall International Series in Computer Science.

[2] J. Shepherdson,et al. Computer programming and formal systems , 1965 .

[3] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .

[4] H. Shyr. Free monoids and languages , 1979 .

[5] Taishin Y. Nishida. Quasi-Deterministic 0L Systems and Their Representation , 1995, Theor. Comput. Sci..

[6] Sven Skyum,et al. Nonterminals, Homomorphisms, and Codings in Different Variations of 0L-Systems , 1974 .

[7] Taishin Y. Nishida. Quasi-Deterministic 0L Systems , 1992, ICALP.

[8] Juha Honkala. Regularity Properties of L Ambiguities of Morphisms , 1992 .

[9] Gheorghe Paun,et al. Language-theoretic problems arising from Richelieu cryptosystems , 1993, Theor. Comput. Sci..

[10] Grzegorz Rozenberg,et al. Developmental systems and languages , 1972, STOC.

[11] Gheorghe Paun,et al. Thin and Slender Languages , 1995, Discret. Appl. Math..

[12] Gheorghe Paun,et al. Closure Properties of Slender Languages , 1993, Theor. Comput. Sci..

[13] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .

[14] Danny Raz. Length Considerations in Context-Free Languages , 1997, Theor. Comput. Sci..

[15] M. Schützenberger,et al. The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[16] Lucian Ilie. On a Conjecture about Slender Context-Free Languages , 1994, Theor. Comput. Sci..