Computational Complementarity for Probabilistic Automata

Cristian S. Calude (), Elena Calude () and Karl Svozil ()
Additional contact information
Cristian S. Calude: Technical University of Wien, Institute of Theoretical Physics
Elena Calude: Massey University at Albany, Institute of Information Sciences
Karl Svozil: Technical University of Wien, Institute of Theoretical Physics

Chapter Chapter 9 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 99-113 from Springer

Abstract: Abstract Motivated by Mermin’s analysis of Einstein-Podolsky-Rosen correlations [24] and [7], we study two computational complementarity principles introduced in [8] for a class of probabilistic automata. We prove the existence of probabilistic automata featuring both types of computational complementarity and we present a method to reduce, under certain conditions, the study of computational complementality of probabilistic automata to the study of computational complementarity of deterministic automata.

Keywords: Quantum Logic; Distinct State; Finite Automaton; Input Symbol; Tree Automaton (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_9

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().