IEICE TRANSACTIONS on Information
Homomorphic Characterizations Are More Powerful Than Dyck Reductions
Summary :
Let L be any class of languages, L' be a class of languages which is closed under λ-free homomorphisms, and Σ be any alphabet. In this paper, we show that if the following statement (1) holds, then the statement (2) holds. (1) For any language L in L over Σ, there exist an alphabet of k pairs of matching parentheses Xk, Dyck reduction Red over Xk, and a language L1 in L' over Σ
- Publication
- IEICE TRANSACTIONS on Information Vol.E80-D No.3 pp.390-392
- Publication Date
- 1997/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Automata,Languages 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
Sadaki HIROSE, Satoshi OKAWA, Haruhiko KIMURA, "Homomorphic Characterizations Are More Powerful Than Dyck Reductions" in IEICE TRANSACTIONS on Information,
vol. E80-D, no. 3, pp. 390-392, March 1997, doi: .
Abstract: Let L be any class of languages, L' be a class of languages which is closed under λ-free homomorphisms, and Σ be any alphabet. In this paper, we show that if the following statement (1) holds, then the statement (2) holds. (1) For any language L in L over Σ, there exist an alphabet of k pairs of matching parentheses Xk, Dyck reduction Red over Xk, and a language L1 in L' over Σ
URL: https://global.ieice.org/en_transactions/information/10.1587/e80-d_3_390/_p
Copy
@ARTICLE{e80-d_3_390,
author={Sadaki HIROSE, Satoshi OKAWA, Haruhiko KIMURA, },
journal={IEICE TRANSACTIONS on Information},
title={Homomorphic Characterizations Are More Powerful Than Dyck Reductions},
year={1997},
volume={E80-D},
number={3},
pages={390-392},
abstract={Let L be any class of languages, L' be a class of languages which is closed under λ-free homomorphisms, and Σ be any alphabet. In this paper, we show that if the following statement (1) holds, then the statement (2) holds. (1) For any language L in L over Σ, there exist an alphabet of k pairs of matching parentheses Xk, Dyck reduction Red over Xk, and a language L1 in L' over Σ
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Homomorphic Characterizations Are More Powerful Than Dyck Reductions
T2 - IEICE TRANSACTIONS on Information
SP - 390
EP - 392
AU - Sadaki HIROSE
AU - Satoshi OKAWA
AU - Haruhiko KIMURA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E80-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1997
AB - Let L be any class of languages, L' be a class of languages which is closed under λ-free homomorphisms, and Σ be any alphabet. In this paper, we show that if the following statement (1) holds, then the statement (2) holds. (1) For any language L in L over Σ, there exist an alphabet of k pairs of matching parentheses Xk, Dyck reduction Red over Xk, and a language L1 in L' over Σ
ER -
English
