In the present paper, we introduce a new type of automata, called generalized group-matrix type automata, for representing general automata in connection with their automorphism groups. A family of subgroups of a given finite group, satisfying a certain condition, called the separation condition, will play a fundamental role.
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
Masami ITO, "Generalized Group-Matrix Type Automata" in IEICE TRANSACTIONS on transactions,
vol. E59-E, no. 11, pp. 9-13, November 1976, doi: .
Abstract: In the present paper, we introduce a new type of automata, called generalized group-matrix type automata, for representing general automata in connection with their automorphism groups. A family of subgroups of a given finite group, satisfying a certain condition, called the separation condition, will play a fundamental role.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e59-e_11_9/_p
Copy
@ARTICLE{e59-e_11_9,
author={Masami ITO, },
journal={IEICE TRANSACTIONS on transactions},
title={Generalized Group-Matrix Type Automata},
year={1976},
volume={E59-E},
number={11},
pages={9-13},
abstract={In the present paper, we introduce a new type of automata, called generalized group-matrix type automata, for representing general automata in connection with their automorphism groups. A family of subgroups of a given finite group, satisfying a certain condition, called the separation condition, will play a fundamental role.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Generalized Group-Matrix Type Automata
T2 - IEICE TRANSACTIONS on transactions
SP - 9
EP - 13
AU - Masami ITO
PY - 1976
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E59-E
IS - 11
JA - IEICE TRANSACTIONS on transactions
Y1 - November 1976
AB - In the present paper, we introduce a new type of automata, called generalized group-matrix type automata, for representing general automata in connection with their automorphism groups. A family of subgroups of a given finite group, satisfying a certain condition, called the separation condition, will play a fundamental role.
ER -