A note on the decomposition of infinite automata

References

• Bavel , Z. 1983 . Introduction to the Theory of Automata , Reston Publishing Company, Inc. .
   Google Scholar
• Gacs , P. 1985 . Reliable computation with cellular automata . Journal of Computer and Systems Sciences , 32 : 79 – 90 .
   Google Scholar
• Biermann A. A fundamental theorem for real time programs Technical Report Dept. of Computer Science, Duke University 1976
   Google Scholar
• Scott , D. . Symposium on the Semantics of Algorithmic Languages . The latice of flow diagrams . Vol. 188 , pp. 309 – 372 . ed. by E. Engeler, Springer Verlag Lecture Notes in Mathematics
   Google Scholar
• Reeker , L. . Proceedings of the International Symposium on Theory of Machines and Computations . State graphs and context free languages . 1971 . pp. 143 – 151 . Academic Press . ed. by Kohavi and Paz
   Google Scholar
• Reeker , L. and Tucci , R. Information and Algorithms . Information Sciences ,
   Google Scholar
• Holcombe , W. M. L. 1982 . Algebraic Automata Theory , Cambridge University Press .
   Google Scholar
• Tucci R. A decomposition theorem for a class of infinite automata in preparation
   Google Scholar