<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00812nam a2200193Ia 4500</leader>
  <controlfield tag="001">CTU_1961</controlfield>
  <controlfield tag="008">210402s9999    xx            000 0 und d</controlfield>
  <datafield tag="082" ind1=" " ind2=" ">
   <subfield code="a">519.233</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
   <subfield code="b">K31</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
   <subfield code="a">Kemeny, T. G.</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2="0">
   <subfield code="a">Finite Markov chains</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2="0">
   <subfield code="c">T. G. Kemeny, J. Laurie Snell</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="a">New Jersey</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="b">D. Van Nostrand</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="c">1960</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">The restriction of this book to finite chains has made it possible to give simple, closed-form matrix expressions for many quantities usually given as series. It is shown that it suffices for all types of problems to consider just two types of Markov chains, namely absorbing and ergodic chains.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
   <subfield code="a">Markov processes,Quy trình Markov</subfield>
  </datafield>
  <datafield tag="904" ind1=" " ind2=" ">
   <subfield code="i">Minh, Hải</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
   <subfield code="a">Trung tâm Học liệu Trường Đại học Cần Thơ</subfield>
  </datafield>
 </record>
</collection>
