TY - JOUR N2 - In the presented paper we discuss pure versions of pushdown automata that have no extra non-input symbols. More specifically, we study pure multi-pushdown automata, which have several pushdown lists. We restrict these automata by the total orders defined over their pushdowns or alphabets and determine the accepting power of the automata restricted in this way. Moreover, we explain the significance of the achieved results and relate them to some other results in the automata theory. L1 - http://journals.pan.pl/Content/118528/PDF-MASTER/meduna_Ordered%20Pure.pdf L2 - http://journals.pan.pl/Content/118528 PY - 2015 IS - No 1 EP - 47 KW - pure multi-pushdown automata KW - total orders KW - accepting power A1 - Meduna, Alexander A1 - Soukup, Ondřej A1 - Zemek, Petr PB - Committee of Informatics of Polish Academy of Science PB - Institute of Theoretical and Applied Informatics of Polish Academy of Science VL - vol. 27 DA - 2015 T1 - Ordered Pure Multi-Pushdown Automata SP - 25 UR - http://journals.pan.pl/dlibra/publication/edition/118528 T2 - Theoretical and Applied Informatics ER -