DocumentCode
562612
Title
Push down automata vs quantum push down automata
Author
Behera, Chandan Kumar ; Nayak, Tanistha ; Meher, Basanti
Author_Institution
Comput. Sci. Eng., Nat. Inst. of Sci. & Technol., Berhampur, India
fYear
2012
fDate
30-31 March 2012
Firstpage
188
Lastpage
191
Abstract
An automaton is a simple model of computer. There are various automata each with its formal definition. Generally an automaton has some form of input, some form of output, internal states may or may not have some form of storage, hardwired not programmable. In this paper we have discussed about Pushdown Automata, Quantum Pushdown Automata by taking some interesting examples. Then the classical Pushdown Automata are compared with Quantum pushdown automata. Our main objective is to know and understand the language recognized by Quantum pushdown automata.
Keywords
pushdown automata; quantum theory; input form; internal states; output form; quantum push down automata; Automata; Finite element methods; Integrated circuits; Pushdown Automata; Quantum Pushdown Automata; Quantum bit (qubit); Quantum computer;
fLanguage
English
Publisher
ieee
Conference_Titel
Advances in Engineering, Science and Management (ICAESM), 2012 International Conference on
Conference_Location
Nagapattinam, Tamil Nadu
Print_ISBN
978-1-4673-0213-5
Type
conf
Filename
6215596
Link To Document