Algebraic theory of probabilistic machines

Placeholder Show Content

Abstract/Contents

Abstract
A definition of a probabilistic automaton is formulated in which its prime decomposition follows as a direct consequence of Krohn-Rhodes theorem. We characterize Green's relations on the monoid of stochastic matrices. The reduced holonomy monoid is induced by the holonomy decomposition of Eilenberg, which is a variant of the prime decomposition. We prove that its representation theory is determined by an iterated wreath product of its holonomy groups.

Description

Type of resource text
Form electronic; electronic resource; remote
Extent 1 online resource.
Publication date 2016
Issuance monographic
Language English

Creators/Contributors

Associated with Yu, Seuk Jun
Associated with Stanford University, Institute for Computational and Mathematical Engineering.
Primary advisor Carlsson, Gunnar
Thesis advisor Carlsson, Gunnar
Thesis advisor Church, Thomas (Thomas Franklin)
Thesis advisor Kim, Inkang
Advisor Church, Thomas (Thomas Franklin)
Advisor Kim, Inkang

Subjects

Genre Theses

Bibliographic information

Statement of responsibility Seuk Jun Yu.
Note Submitted to the Institute for Computational and Mathematical Engineering.
Thesis Thesis (Ph.D.)--Stanford University, 2016.
Location electronic resource

Access conditions

Copyright
© 2016 by Seuk Jun Yu
License
This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).

Also listed in

Loading usage metrics...