Context-Free Grammars with Memory
Summary :
CFGs (context-free grammars) with various types of memory are introduced and their generative capacities are investigated. For an automata-theoretic characterization, a new type of automaton called partitioning automaton is introduced and it is shown that the class of languages generated by CFGs with memory type X is equal to the class of languages accepted by partitioning automata of type X.
- Publication
- IEICE TRANSACTIONS on Information Vol.E75-D No.6 pp.847-851
- Publication Date
- 1992/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Automaton, Language and Theory of Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Etsuro MORIYA, "Context-Free Grammars with Memory" in IEICE TRANSACTIONS on Information,
vol. E75-D, no. 6, pp. 847-851, November 1992, doi: .
Abstract: CFGs (context-free grammars) with various types of memory are introduced and their generative capacities are investigated. For an automata-theoretic characterization, a new type of automaton called partitioning automaton is introduced and it is shown that the class of languages generated by CFGs with memory type X is equal to the class of languages accepted by partitioning automata of type X.
URL: https://global.ieice.org/en_transactions/information/10.1587/e75-d_6_847/_p
Copy
@ARTICLE{e75-d_6_847,
author={Etsuro MORIYA, },
journal={IEICE TRANSACTIONS on Information},
title={Context-Free Grammars with Memory},
year={1992},
volume={E75-D},
number={6},
pages={847-851},
abstract={CFGs (context-free grammars) with various types of memory are introduced and their generative capacities are investigated. For an automata-theoretic characterization, a new type of automaton called partitioning automaton is introduced and it is shown that the class of languages generated by CFGs with memory type X is equal to the class of languages accepted by partitioning automata of type X.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Context-Free Grammars with Memory
T2 - IEICE TRANSACTIONS on Information
SP - 847
EP - 851
AU - Etsuro MORIYA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - November 1992
AB - CFGs (context-free grammars) with various types of memory are introduced and their generative capacities are investigated. For an automata-theoretic characterization, a new type of automaton called partitioning automaton is introduced and it is shown that the class of languages generated by CFGs with memory type X is equal to the class of languages accepted by partitioning automata of type X.
ER -
English
