Eigenschaften der von linearen Automaten erkennbaren Worte
Tóm tắt
The paper investigates the set of words accepted by a linear sequential machine M and the algebraic structure of this set. If M is nonsingular a strong relationship exists between this set and the transition group of the accepting automaton. Thus the algebraic structure of this group is used to describe some properties of the set of accepted words. If M is nilpotent, in addition, an algorithm is given which in a direct way generates just the words accepted by M.
Tài liệu tham khảo
Brzozowski, J. A.: Regular expressions for linear sequential circuits. IEEE Trans. Electronic Computers EC-14, 148–156 (1956)
Ecker, K.: On the semigroup of a linear nonsingular automaton. Math. Systems Theory 6, 353–358 (1973)
Ginzburg, A.: Algebraic theory of automata. London-New York: Academic Press 1968
Harrison, M. A.: Lectures on linear sequential machines. London-New York: Academic Press 1969
Herman, G. T.: Linear regular languages, Part I. Acta Cybernetica 1, 3–12 (1969)
Herman, G. T.: Linear regular languages, Part II. Acta Cybernetica 1, 41–56 (1971)
Kowalsky, H. J.: Lineare Algebra. 6. Auflage Berlin: De Gruyter 1972
Maclane, S., Birkhoff, G.: Algebra. London: Macmillan 1971.