A left identity type automation is defined as a finite automation whose transformation semigroup has a left identity. In this paper, we give a necessary and sufficient condition for a given automaton to be of left identity type in terms of the generators of its transformation semigroup.
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
Toshimasa WATANABE, Akira NAKAMURA, "A Note on the Transformation Semigroups of Finite Automata" in IEICE TRANSACTIONS on transactions,
vol. E64-E, no. 2, pp. 88-89, February 1981, doi: .
Abstract: A left identity type automation is defined as a finite automation whose transformation semigroup has a left identity. In this paper, we give a necessary and sufficient condition for a given automaton to be of left identity type in terms of the generators of its transformation semigroup.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e64-e_2_88/_p
Copy
@ARTICLE{e64-e_2_88,
author={Toshimasa WATANABE, Akira NAKAMURA, },
journal={IEICE TRANSACTIONS on transactions},
title={A Note on the Transformation Semigroups of Finite Automata},
year={1981},
volume={E64-E},
number={2},
pages={88-89},
abstract={A left identity type automation is defined as a finite automation whose transformation semigroup has a left identity. In this paper, we give a necessary and sufficient condition for a given automaton to be of left identity type in terms of the generators of its transformation semigroup.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - A Note on the Transformation Semigroups of Finite Automata
T2 - IEICE TRANSACTIONS on transactions
SP - 88
EP - 89
AU - Toshimasa WATANABE
AU - Akira NAKAMURA
PY - 1981
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E64-E
IS - 2
JA - IEICE TRANSACTIONS on transactions
Y1 - February 1981
AB - A left identity type automation is defined as a finite automation whose transformation semigroup has a left identity. In this paper, we give a necessary and sufficient condition for a given automaton to be of left identity type in terms of the generators of its transformation semigroup.
ER -