×

On a conjecture about slender context-free languages. (English) Zbl 0938.68707


MSC:

68Q45 Formal languages and automata
Full Text: DOI

References:

[1] Andraşiu, M.; Dassow, J.; Pa\check{}un, Gh.; Salomaa, A.: Language-theoretic problems arising from richelieu cryptosystems. Theoret. comput. Sci. 116, 339-357 (1993) · Zbl 0797.68094
[2] Dassow, J.; Pa\check{}un, Gh.; Salomaa, A.: On thinness and slenderness of L languages. Bull. EATCS 49, 152-158 (1993) · Zbl 1023.68607
[3] Pa\check{}un, Gh.; Salomaa, A.: Decision problems concerning the thinness of DOL languages. Bull. EATCS 46, 171-181 (1992) · Zbl 0803.68061
[4] Gh. Pa\check{}un and A. Salomaa, Thin and slender languages, Discrete Appl. Math., to appear.
[5] Pa\check{}un, Gh.; Salomaa, A.: Closure properties of slender languages. Theoret. computer sci. 120, 293-301 (1993) · Zbl 0801.68106
[6] Salomaa, A.: Formal languages. (1973) · Zbl 0262.68025
[7] Salomaa, A.: Public-key cryptography. (1990) · Zbl 0712.68003
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.