article · 1973
N-decomposition and decomposition matrix for automata
Cited by 0Open access
Abstract
This continues the study on generalized mutiple decomposition allowing 2-way interconnection [1]. Let NεZ+.An automaton M = <D, T,F> is an N-automaton iff the set of states D ≤ πSi and each Si = πi (D) where πi is the projection map onto the ith component. Since the states in an N-automation are N-tuples, we may interpret M as consisting of N component automata Ml,..MN, where Mi = <Si, πSj,fi> for each i.If (sl,..sN,t)ε D(F),then fi (si,(πsi,t))= πi(F((sl,..SN),t). We call an N-automation M = <D,T,F> a generalized N-decomposition (GND) of M = <S,T,f> if M realizes M. Any GND of M induces a set of N *-covers on S. A sufficient condition for a set of *-covers to give rise to a GND is established. The Properties of a GND can be represented by a matrix of relations. The diagonal entries are induced by the components and the off-diagonal entries represent the interconnections.The conditions which give rise to zero connection lines are then determined.
Cite this paper
Poe, A. (1973). N-decomposition and decomposition matrix for automata. https://doi.org/10.1145/800192.805786
Poe, Arthur. “N-decomposition and decomposition matrix for automata.” 1973, pp. 440.1–441, https://doi.org/10.1145/800192.805786.
Poe, Arthur. 1973. “N-decomposition and decomposition matrix for automata.” https://doi.org/10.1145/800192.805786.
Poe, A. (1973) ‘N-decomposition and decomposition matrix for automata’. Available at: https://doi.org/10.1145/800192.805786.
@article{poe1973decomposition,
title = {{N-decomposition and decomposition matrix for automata}},
author = {Poe, Arthur},
pages = {440.1--441},
year = {1973},
doi = {10.1145/800192.805786}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.