Abstract
Automata are simple mathematical objects with unexpected computational, mathematical, modelling and explanatory capabilities. This paper examines some relations between automata and physics. Automata will be used to model quantum uncertainty and quantum computation. Finally, mathematical proofs will be discussed from the perspective of quantum automata.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ambainis, A., Freivalds, R. 1-way quantum finite automata: strengths, weaknesses and generalizations, Proceedings of 39th IEEE FOCS (1998), 332–341.
Ambainis, A., Watrous, J. Two-way finite automata with quantum and classical states, Technical Report, CC/9911009, 1999.
Bavel, Z., and Muller, D. E. Connectivity and reversibility in automata, J. Assoc. Comput. Mach. 17 (1970), 231–240.
Bell, J. S. On the Einstein Podolsky Rosen paradox, Physics, 1 (1964), 195–200. Reprinted in [5] pp. 14–21.
Bell, J. S. Speakable and Unspeakable in Quantum Mechanics, Cambridge University Press, Cambridge, 1987.
Brauer, W. Automatentheorie, Teubner, Stuttgart, 1984.
Bridgman, P. W. A physicists second reaction to Mengenlehre, Scripta Mathematica 2 (1934), 101–117, 224–234.
Brodsky, A., Pippenger, N. Characterisation of 1-way quantum finite automata, quantph/9903014, 1999.
Calude, A. S. The journey of the four colour theorem through time, The New Zealand Mathematics Magazine 38, 3 (2001), 1–10.
Calude, C. S., Calude, E. Bisimulations and behaviour of nondeterministic automata, in G. Rozenberg, W. Thomas (eds.) Developments in Language Theory. Foundations, Applications, and Perspectives, World Scientific, Singapore, 2000, 60–70.
Calude, C. S., Calude, E., Chiu, T., Dumitrescu, M., and Nicolescu, R. Testing computational complementarity for Mermin automata, J. Multi Valued Logic, 6 (2001), 47–65.
Calude, C. S., Calude, E., Khoussainov, B. Deterministic automata: Simulation, universality and minimality, Annals of Applied and Pure Logic 90, 1–3 (1997), 263–276.
Calude, C. S., Calude, E., Khoussainov, B. Finite nondeterministic automata: Simulation and minimality, Theoret. Comput. Sci. 242, 1–2 (2000), 219–235.
Calude, C. S., Calude, E., Svozil, K. Computational complementarity for probabilistic automata, in C. Martin-Vide, V. Mitrana (eds.). Where Mathematics, Computer Science, Linguistics and Biology Meet, Kluwer, Amsterdam 2000, 99–113.
Calude, C. S., Calude, E., Svozil, K., and Yu, S. Physical versus computational complementarity I, International Journal of Theoretical Physics 36 (1997), 1495–1523.
Calude, C. S., Calude, E., Ştefăanescu, C. Computational complementarity for Mealy automata, EATCS Bull. 66 (1998), 139–149.
Chaitin, G. J. ewblock An improvement on a theorem by E. F. Moore. IEEE Transactions on Electronic Computers EC-14 (1965), 466–467.
Ciamarra, M. P. Quantum reversibility and a new model of quantum automaton, in R. Freivalds (ed.). The 13th International Symposium on Foundations of Computation Theory (FCT’2001), Riga, Latvia, Springer-Verlag, Lect. Notes Comput. Sci. 2138, 2001, 376–379.
Cohen, D. W. An Introduction to Hilbert Space and Quantum Logic, Springer, New York, 1989.
Conway, J. H. Regular Algebra and Finite Machines, Chapman and Hall Ltd., London, 1971.
Deutsch, D. Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society London, A 400(1985), 97–119.
Einstein, A., Podolsky, B., and Rosen, N. Can quantum-mechanical description of physical reality be considered complete? Physical Review 47 (1935), 777–780.
Finkelstein, D., and Finkelstein, S. R. Computational complementarity, International Journal of Theoretical Physics 22, 8 (1983), 753–779.
Foulis, D. J., and Randall, C. Operational statistics. i. Basic concepts, Journal of Mathematical Physics 13 (1972), 1667–1675.
Frank, M., Knight, T., Margolus, N. Reversibility in optimally scalable computer architectures, In Unconventional Models of Computation, C. S. Calude, J. Casti, M. Dinneen, Eds., Springer-Verlag, 1998, 165–182.
Gill, A. State-identification experiments in finite automata, Information and Control 4 (1961), 132–154.
Ginsburg, S. On the length of the smallest uniform experiment which distinguishes the terminal states of the machine, J. Assoc. Comput. Mach. 5 (1958), 266–280.
Giuntini, R. Quantum Logic and Hidden Variables. BI Wissenschaftsverlag, Mannheim, 1991.
Greenberger, D. B., Horne, M., and Zeilinger, A. Multiparticle interferometry and the superposition principle, Physics Today 46 (August 1993), 22–29.
Gruska, J. Quantum Computing, McGraw-Hill, London, 1999.
Hopcroft, J. E., and Ullman, J. D. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
Kochen, S., and Specker, E. P. The problem of hidden variables in quantum mechanics, Journal of Mathematics and Mechanics 17, 1 (1967), 59–87.
Kondacs, A., Watrous, J. On the power of quantum finite state automata, Proceedings of 38th IEEE FOCS, 1997, 66–75.
Kozen, D. Automata and Computability, Springer-Verlag, NewYork, 1997.
Moore, C. Dynamical recognizers: real-time language recognition by analogue computers, Theoret. Comput. Sci. 201 (1998), 99–136.
Moore, C. Email to C. S. Calude, 10 May 2001.
Moore, C. Crutchfield, J. P. Quantum automata and quantum grammars, Theoret. Comput. Sci. 237 (2000), 275–306.
Moore, E. F. Gedanken-experiments on sequential machines, In Automata Studies, C. E. Shannon and J. McCarthy, Eds., Princeton University Press, Princeton, 1956, 129–153.
Paschen, K. Quantum finite automata using ancilla qubits, manuscript, May 2001.
Penrose, R. Shadows of the Minds, A Search for the Missing Science of Consciousness, Oxford University Press, Oxford, 1994.
Rabin, M.O. Probabilistic automata, Information and Control 6 (1963), 230–244.
Salomaa, A. Computation and Automata, Cambridge University Press, Cambridge, 1985.
Svozil, K. Randomness & Undecidability in Physics, World Scientific, Singapore, 1993.
Wright, R. Generalized urn models, Foundations of Physics 20 (1990), 881–903.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calude, C.S., Calude, E. (2002). Automata: From Uncertainty to Quantum. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_1
Download citation
DOI: https://doi.org/10.1007/3-540-46011-X_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43453-5
Online ISBN: 978-3-540-46011-4
eBook Packages: Springer Book Archive