This letter reports on the condition for applying a feedback connection to a deterministic finite automata. First we define the partial delayed dependence condition for the feedback connection, and then consider problems related to the completeness problem of automata.
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.
Copy
Vakhtang LASHKIA, Akihiro NOZAKI, "On Completeness of Automata" in IEICE TRANSACTIONS on Information,
vol. E81-D, no. 11, pp. 1305-1307, November 1998, doi: .
Abstract: This letter reports on the condition for applying a feedback connection to a deterministic finite automata. First we define the partial delayed dependence condition for the feedback connection, and then consider problems related to the completeness problem of automata.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_11_1305/_p
Copy
@ARTICLE{e81-d_11_1305,
author={Vakhtang LASHKIA, Akihiro NOZAKI, },
journal={IEICE TRANSACTIONS on Information},
title={On Completeness of Automata},
year={1998},
volume={E81-D},
number={11},
pages={1305-1307},
abstract={This letter reports on the condition for applying a feedback connection to a deterministic finite automata. First we define the partial delayed dependence condition for the feedback connection, and then consider problems related to the completeness problem of automata.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - On Completeness of Automata
T2 - IEICE TRANSACTIONS on Information
SP - 1305
EP - 1307
AU - Vakhtang LASHKIA
AU - Akihiro NOZAKI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 1998
AB - This letter reports on the condition for applying a feedback connection to a deterministic finite automata. First we define the partial delayed dependence condition for the feedback connection, and then consider problems related to the completeness problem of automata.
ER -