IEICE TRANSACTIONS on transactions
A Simple Proof of the Closure Property of Real-Time One-Way Cellular Automata Languages under Reversal Operation
Summary :
A simpler and more straightforward proof is given for the recently-proved theorem such that real-time one-way cellular automata languages are closed under reversal.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E68-E No.11 pp.740-741
- Publication Date
- 1985/11/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
Hiroshi UMEO, "A Simple Proof of the Closure Property of Real-Time One-Way Cellular Automata Languages under Reversal Operation" in IEICE TRANSACTIONS on transactions,
vol. E68-E, no. 11, pp. 740-741, November 1985, doi: .
Abstract: A simpler and more straightforward proof is given for the recently-proved theorem such that real-time one-way cellular automata languages are closed under reversal.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e68-e_11_740/_p
Copy
@ARTICLE{e68-e_11_740,
author={Hiroshi UMEO, },
journal={IEICE TRANSACTIONS on transactions},
title={A Simple Proof of the Closure Property of Real-Time One-Way Cellular Automata Languages under Reversal Operation},
year={1985},
volume={E68-E},
number={11},
pages={740-741},
abstract={A simpler and more straightforward proof is given for the recently-proved theorem such that real-time one-way cellular automata languages are closed under reversal.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - A Simple Proof of the Closure Property of Real-Time One-Way Cellular Automata Languages under Reversal Operation
T2 - IEICE TRANSACTIONS on transactions
SP - 740
EP - 741
AU - Hiroshi UMEO
PY - 1985
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E68-E
IS - 11
JA - IEICE TRANSACTIONS on transactions
Y1 - November 1985
AB - A simpler and more straightforward proof is given for the recently-proved theorem such that real-time one-way cellular automata languages are closed under reversal.
ER -
English
