A Note on the Equivalence Problem for a Class of Unary L-Systems
Summary :
The class of languages generated by unary TOL systems with regular control is considered and investigated. It is shown that the equivalence problem for unary TOL systems with ultimately periodic regular control is decidable. The problems for other versions of unary TOL systems are discussed.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E64-E No.8 pp.551-552
- Publication Date
- 1981/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Automata and Languages
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
Takashi YOKOMORI, "A Note on the Equivalence Problem for a Class of Unary L-Systems" in IEICE TRANSACTIONS on transactions,
vol. E64-E, no. 8, pp. 551-552, August 1981, doi: .
Abstract: The class of languages generated by unary TOL systems with regular control is considered and investigated. It is shown that the equivalence problem for unary TOL systems with ultimately periodic regular control is decidable. The problems for other versions of unary TOL systems are discussed.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e64-e_8_551/_p
Copy
@ARTICLE{e64-e_8_551,
author={Takashi YOKOMORI, },
journal={IEICE TRANSACTIONS on transactions},
title={A Note on the Equivalence Problem for a Class of Unary L-Systems},
year={1981},
volume={E64-E},
number={8},
pages={551-552},
abstract={The class of languages generated by unary TOL systems with regular control is considered and investigated. It is shown that the equivalence problem for unary TOL systems with ultimately periodic regular control is decidable. The problems for other versions of unary TOL systems are discussed.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - A Note on the Equivalence Problem for a Class of Unary L-Systems
T2 - IEICE TRANSACTIONS on transactions
SP - 551
EP - 552
AU - Takashi YOKOMORI
PY - 1981
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E64-E
IS - 8
JA - IEICE TRANSACTIONS on transactions
Y1 - August 1981
AB - The class of languages generated by unary TOL systems with regular control is considered and investigated. It is shown that the equivalence problem for unary TOL systems with ultimately periodic regular control is decidable. The problems for other versions of unary TOL systems are discussed.
ER -
English
