Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: pure multi-pushdown automata

Sortuj według:

Ogranicz wyniki do:

Ordered Pure Multi-Pushdown Automata

Meduna A., Soukup O., Zemek P.

Theoretical and Applied Informatics

2015

Vol. 27, No. 1

25--47

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.