Algebraic theory of automata networks: an introduction
Pal Domosi, Chrystopher L. Nehaniv (Society for Industrial and Applied Mathematics, 2005)
|
| Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories, such as those of semigroups, groups, rings, and fields. The authors also investigate automata networks as products of automata, that is, as compositions of automata obtained by cascading without feedback or with feedback of various restricted types or, most generally, with the feedback dependencies controlled by an arbitrary directed graph. This self-contained book surveys and extends the fundamental results in regard to automata networks, including the main decomposition theorems of Letichevsky, of Krohn and Rhodes, and of others. |
 Algebraic theory of automata networks an introduction.pdf :: Unduh
|
| No. Panggil : | e20442985 |
| Entri utama-Nama orang : | |
| Entri tambahan-Nama orang : | |
| Subjek : | |
| Penerbitan : | Philadelphia : Society for Industrial and Applied Mathematics, 2005 |
| Sumber Pengatalogan: | LibUI eng rda |
| Tipe Konten: | text |
| Tipe Media: | computer |
| Tipe Pembawa: | online resource |
| Deskripsi Fisik: | xii, 271 pages : illustration |
| Tautan: | http://portal.igpublish.com/iglibrary/search/SIAMB0000060.main.html?1 |
| Lembaga Pemilik: | |
| Lokasi: |
| No. Panggil | No. Barkod | Ketersediaan |
|---|---|---|
| e20442985 | 02-17-075355294 | TERSEDIA |
| Ulasan: |
| Tidak ada ulasan pada koleksi ini: 20442985 |
