×

Representation theorems using DOS languages. (English) Zbl 0504.68047


MSC:

68Q45 Formal languages and automata
68Q42 Grammars and rewriting systems
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Buttlemann, H. W.; Pyster, A.; Reeker, L. H., Grammars without syntactic variables, (Technical Report 74-1 (1974), University of Oregon, Department of Computer Science)
[2] Ehrenfeucht, A.; Rozenberg, G., On basic properties of DOS systems and languages, Information and Control, 47, 137-153 (1980) · Zbl 0469.68076
[3] Ehrenfeucht, A.; Rozenberg, G., On the emptiness of the intersection of two DOS languages problem, Information Processing Lett., 10, 223-225 (1979) · Zbl 0467.68069
[4] Harju, T.; Pentonen, M., Some decidability problems of sentential forms, Internat. J. Comput. Math., 7, 95-108 (1979)
[5] Maurer, H. A.; Salomaa, A.; Wood, D., Pure Grammars, (Computer Science Technical Report No. 79-CS-7 (1979), Department of Applied Mathematics, McMaster University) · Zbl 0446.68063
[6] Salomaa, A., Formal Languages (1973), Academic Press: Academic Press New York · Zbl 0262.68025
[7] Salomaaa, A., On sentential forms of context-free grammars, Acta Informat., 2, 40-49 (1973) · Zbl 0264.68029
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.