Applications of automata and graphs: Labeling operators in Hilbert space. II
Journal Article
·
· Journal of Mathematical Physics
- St. Ambrose University, Davenport, Iowa 52803 (United States)
We introduced a family of infinite graphs directly associated with a class of von Neumann automaton model A{sub G}. These are finite state models used in symbolic dynamics: stimuli models and in control theory. In the context of groupoid von Neumann algebras, and an associated fractal group, we prove a classification theorem for representations of automata.
- OSTI ID:
- 21294172
- Journal Information:
- Journal of Mathematical Physics, Vol. 50, Issue 6; Other Information: DOI: 10.1063/1.3141524; (c) 2009 American Institute of Physics; Country of input: International Atomic Energy Agency (IAEA); ISSN 0022-2488
- Country of Publication:
- United States
- Language:
- English
Similar Records
COMPLEXITY OF ANALYSIS & VERIFICATION PROBLEMS FOR COMMUNICATING AUTOMATA & DISCRETE DYNAMICAL SYSTEMS
Complexity of analysis and verification problems for communicating automata and discrete dynamical systems.
Recursive definition of global cellular-automata mappings
Conference
·
Thu Mar 01 00:00:00 EST 2001
·
OSTI ID:21294172
Complexity of analysis and verification problems for communicating automata and discrete dynamical systems.
Conference
·
Mon Jan 01 00:00:00 EST 2001
·
OSTI ID:21294172
+2 more
Recursive definition of global cellular-automata mappings
Journal Article
·
Tue Feb 01 00:00:00 EST 1994
· Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics; (United States)
·
OSTI ID:21294172