×
Takahashi, Masako

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

Theor. Comput. Sci. 22, 253-264 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0497.68045

Cited in 3 Documents

MSC:

68Q45 Formal languages and automata

Keywords:

language generated by a context-free grammar; one-dimensional expressions of the recognizable sets of binary trees; closure properties under relativized operations; relativized versions of AFL operations; generalized parenthesis languages
PDF BibTeX XML Cite
\textit{M. Takahashi}, Theor. Comput. Sci. 22, 253--264 (1983; Zbl 0497.68045)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] Eilenberg, S., Automata, languages, and machines, vol. A, (1974), 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, () · 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.