Nest sets and relativized closure properties. (English) Zbl 0497.68045


68Q45 Formal languages and automata
Full Text: DOI


[1] Eilenberg, S., Automata, Languages, and Machines, Vol. A (1974), Academic Press: Academic Press New York · Zbl 0317.94045
[2] Ginsburg, S.; Harrison, M., Bracketed context-free languages, J. Comput. System Sci., 1, 1-23 (1967) · Zbl 0153.00802
[3] Greibach, S. A.; Friedman, E. P., Superdeterministic PDAs, J. ACM, 27, 675-700 (1982) · Zbl 0462.68030
[4] Marchand, P., Grammaires parenthésées et bilangages reguliers, R.A.I.R.O., 14, 3-38 (1980) · Zbl 0452.68072
[5] Mckinsey, J. C.C.; Tarski, A., The algebra of topology, Ann. of Math., 45, 141-191 (1944) · Zbl 0060.06206
[6] McNaughton, R., Parenthesis grammars, J. ACM, 14, 490-500 (1967) · Zbl 0168.01206
[7] Ogden, W. F.; Rounds, W. C., Composition of \(n\) tree transformations, Proc. 4th ACM Symposium on Theory of Computing, 198-206 (1972) · Zbl 0358.68089
[8] Takahashi, M., Generalizations of regular sets and their application to a study of context-free languages, Information and Control, 27, 1-35 (1975) · Zbl 0291.68031
[9] Takahashi, M.; Yamasaki, H., On generalized parenthesis languages, (Proc. 7th Colloquium on Trees in Algebra and Programming (1982), Lille: Lille France) · Zbl 0539.68067
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.