Ordered Pure Multi-Pushdown Automata

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F15%3APU121560" target="_blank" >RIV/00216305:26230/15:PU121560 - isvavai.cz</a>

Result on the web

<a href="https://taai.iitis.pl/taai/article/download/vol27no1pp25/pdf" target="_blank" >https://taai.iitis.pl/taai/article/download/vol27no1pp25/pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.20904/271025" target="_blank" >10.20904/271025</a>

Result language

angličtina

Original language name

Ordered Pure Multi-Pushdown Automata

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2015

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Theoretical and Applied Informatics

ISSN

1896-5334

e-ISSN

—

Volume of the periodical

27

Issue of the periodical within the volume

1

Country of publishing house

PL - POLAND

Number of pages

21

Pages from-to

25-47

UT code for WoS article

—

EID of the result in the Scopus database

—