The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 결정론적 선형 푸시다운 트리 오토마타(결정론적 L-PDTA)와 몇 가지 변형을 연구합니다. 결정론적 L-PDTA에 의한 입력 트리 인식은 선형 시간에 완료될 수 있으므로 결정론적 L-PDTA는 다양한 종류의 애플리케이션에 적용 가능합니다. 다양한 결정론적 L-PDTA에 의해 정의된 트리 언어 클래스 간에 엄격한 계층 구조가 표시됩니다. 또한 결정론적 L-PDTA는 비결정론적 L-PDTA와 약하게 동일하다는 것도 보여질 것입니다.
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.
부
Akio FUJIYOSHI, "Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 2, pp. 248-254, February 2009, doi: 10.1587/transinf.E92.D.248.
Abstract: In this paper, we study deterministic linear pushdown tree automata (deterministic L-PDTAs) and some variations. Since recognition of an input tree by a deterministic L-PDTA can be done in linear time, deterministic L-PDTAs are applicable to many kinds of applications. A strict hierarchy will be shown among the classes of tree languages defined by a variety of deterministic L-PDTAs. It will be also shown that deterministic L-PDTAs are weakly equivalent to nondeterministic L-PDTAs.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.248/_p
부
@ARTICLE{e92-d_2_248,
author={Akio FUJIYOSHI, },
journal={IEICE TRANSACTIONS on Information},
title={Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata},
year={2009},
volume={E92-D},
number={2},
pages={248-254},
abstract={In this paper, we study deterministic linear pushdown tree automata (deterministic L-PDTAs) and some variations. Since recognition of an input tree by a deterministic L-PDTA can be done in linear time, deterministic L-PDTAs are applicable to many kinds of applications. A strict hierarchy will be shown among the classes of tree languages defined by a variety of deterministic L-PDTAs. It will be also shown that deterministic L-PDTAs are weakly equivalent to nondeterministic L-PDTAs.},
keywords={},
doi={10.1587/transinf.E92.D.248},
ISSN={1745-1361},
month={February},}
부
TY - JOUR
TI - Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata
T2 - IEICE TRANSACTIONS on Information
SP - 248
EP - 254
AU - Akio FUJIYOSHI
PY - 2009
DO - 10.1587/transinf.E92.D.248
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2009
AB - In this paper, we study deterministic linear pushdown tree automata (deterministic L-PDTAs) and some variations. Since recognition of an input tree by a deterministic L-PDTA can be done in linear time, deterministic L-PDTAs are applicable to many kinds of applications. A strict hierarchy will be shown among the classes of tree languages defined by a variety of deterministic L-PDTAs. It will be also shown that deterministic L-PDTAs are weakly equivalent to nondeterministic L-PDTAs.
ER -