Detail publikace

Ordered Pure Multi-Pushdown Automata

MEDUNA, A. SOUKUP, O. ZEMEK, P.

Originální název

Ordered Pure Multi-Pushdown Automata

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

pure multi-pushdown automata, total orders, accepting power

Autoři

MEDUNA, A.; SOUKUP, O.; ZEMEK, P.

Rok RIV

2015

Vydáno

31. 12. 2015

ISSN

1896-5334

Periodikum

Theoretical and Applied Informatics

Ročník

27

Číslo

1

Stát

Polská republika

Strany od

25

Strany do

47

Strany počet

21

URL

https://journals.pan.pl/tai/135572

BibTex

@article{BUT130904,
  author="Alexandr {Meduna} and Ondřej {Soukup} and Petr {Zemek}",
  title="Ordered Pure Multi-Pushdown Automata",
  journal="Theoretical and Applied Informatics",
  year="2015",
  volume="27",
  number="1",
  pages="25--47",
  doi="10.20904/271025",
  issn="1896-5334",
  url="https://journals.pan.pl/tai/135572"
}

Dokumenty

meduna_Ordered Pure.pdf