PROBABILISTIC FINITE STATE SYSTEM IDENTIFICATION

References

• This paper is based on and parts are taken from the author's doctoral dissertation .
   Google Scholar
• T. L. Booth , Sequential Machines and Automata Theory . John Wiley and Sons , New York , 1967 .
   Google Scholar
• J. W. Carlyle , “ Stochastic Finite-State System Theory .” In: System Theory , edited by L. A. Zadeh and E. Polak , McGraw-Hill , New York , 1969 .
   Google Scholar
• B. R. Gaines , “ On the Complexity of Causal Models .” IEEE Transactions on Systems, Man, and Cybernetics , SMC- 6 , No. 1 , 1976 .
   Web of Science ®Google Scholar
• B. R. Gaines , “ System Identification, Approximation and Complexity .” International Journal of General Systems , 3 , No. 3 , 1977 , pp. 145 – 174 .
   Web of Science ®Google Scholar
• R. Gerardy , “ System Identification The Problem of Using Internal States .” In Systems Science and Science , Proceedings of the twenty-fourth annual North American meeting of the Society for General Systems Research , San Francisco , 1980 .
   Google Scholar
• R. Gerardy , Methods for the Identification of Probabilistic Finite State Systems . Ph.D. Dissertation , Slate University of New York at Binghamton , Binghamlon , New York , 1981 .
   Google Scholar
• A. Gill , Introduction to the Theory of Finite-State Machines . McGraw-Hill , New York , 1962 .
   Google Scholar
• J. H. Holland , Adaptation in Natural and Artificial Systems . University of Michigan Press , Ann Arbor , 1975 .
   Google Scholar
• G. J. Klir , Introduction to the Methodology of Switching Circuits , D. van Nostrand , New York , 1972 .
   Google Scholar
• G. J. Klir , “ On the Representation of Activity Arrays .” International Journal of General Systems , 2 , No. 3 , 1975 , pp. 149 – 168 .
   Web of Science ®Google Scholar
• N. J. Nilsson , Problem-Solving Methods in Artificial Intelligence . McGraw-Hill , New York , 1971 .
   Google Scholar
• J. Pearl , “ State Complexity of Imprecise Causal Models .” IEEE Transactions on Systems, Man, and Cybernetics , SMC- 6 , No. 9 , 1976 , pp. 652 – 655 .
   Google Scholar
• The algorithms in this paper are described using a pseudocode based on the PASCAL programming language. That is, the control structures of PASCAL are used, but English statements are used in place of formal statements as necessary. The reader who is unfamiliar with PASCAL may consult any of the many excellent texts on the language .
   Google Scholar