We introduce a generalized cln grammar (gclng), a generalization of a completely linearly nested context-free grammar (clncfg), of which variables are partitioned linearly and each rule satisfies similar conditions as those of clncfg related to its partition. We show that the class of languages generated by gclng's coincides with the class of quasi-rational languages, and consider the inclusion relations between languages generated by gclng's and those generated by clncfg's.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tetsuo MORITA, "A Note on a Completely Linearly Nested Context-Free Grammar and Its Generalization" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 12, pp. 2106-2108, December 1994, doi: .
Abstract: We introduce a generalized cln grammar (gclng), a generalization of a completely linearly nested context-free grammar (clncfg), of which variables are partitioned linearly and each rule satisfies similar conditions as those of clncfg related to its partition. We show that the class of languages generated by gclng's coincides with the class of quasi-rational languages, and consider the inclusion relations between languages generated by gclng's and those generated by clncfg's.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_12_2106/_p
Copy
@ARTICLE{e77-a_12_2106,
author={Tetsuo MORITA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Note on a Completely Linearly Nested Context-Free Grammar and Its Generalization},
year={1994},
volume={E77-A},
number={12},
pages={2106-2108},
abstract={We introduce a generalized cln grammar (gclng), a generalization of a completely linearly nested context-free grammar (clncfg), of which variables are partitioned linearly and each rule satisfies similar conditions as those of clncfg related to its partition. We show that the class of languages generated by gclng's coincides with the class of quasi-rational languages, and consider the inclusion relations between languages generated by gclng's and those generated by clncfg's.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A Note on a Completely Linearly Nested Context-Free Grammar and Its Generalization
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2106
EP - 2108
AU - Tetsuo MORITA
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 1994
AB - We introduce a generalized cln grammar (gclng), a generalization of a completely linearly nested context-free grammar (clncfg), of which variables are partitioned linearly and each rule satisfies similar conditions as those of clncfg related to its partition. We show that the class of languages generated by gclng's coincides with the class of quasi-rational languages, and consider the inclusion relations between languages generated by gclng's and those generated by clncfg's.
ER -