Publication result detail

Reducing Deep Pushdown Automata and Infinite Hierarchy

SCHÖNECKER, R.; KŘIVKA, Z.; MEDUNA, A.

Original Title

Reducing Deep Pushdown Automata and Infinite Hierarchy

English Title

Reducing Deep Pushdown Automata and Infinite Hierarchy

Type

Paper in proceedings outside WoS and Scopus

Original Abstract

This contribution presents reducing variant of the deep pushdown automata.
Deep pushdown automata is a new generalization of the classical pushdown automata.
The basic idea of the modification consists of allowing these automata to access more deeper parts of pushdown
and reducing strings to non-input symbols in the pushdown.
It works similarly to bottom-up analysis simulation of context-free grammars in the classical pushdown automata
except it reads the input from the right to the left.
Further, this paper presents results concerning the equivalence of reducing deep pushdown automata with n-limited state grammars
and infinite hierarchy of language families based on that and one open problem.

English abstract

This contribution presents reducing variant of the deep pushdown automata.
Deep pushdown automata is a new generalization of the classical pushdown automata.
The basic idea of the modification consists of allowing these automata to access more deeper parts of pushdown
and reducing strings to non-input symbols in the pushdown.
It works similarly to bottom-up analysis simulation of context-free grammars in the classical pushdown automata
except it reads the input from the right to the left.
Further, this paper presents results concerning the equivalence of reducing deep pushdown automata with n-limited state grammars
and infinite hierarchy of language families based on that and one open problem.

Keywords

Automata Theory, Top-Down Parser, Bottom-Up Parser, Deep Pushdown Automata, Infinite hierarchy, Reduction Operation, Shift Operation

Key words in English

Automata Theory, Top-Down Parser, Bottom-Up Parser, Deep Pushdown Automata, Infinite hierarchy, Reduction Operation, Shift Operation

Authors

SCHÖNECKER, R.; KŘIVKA, Z.; MEDUNA, A.

Released

27.10.2006

Publisher

Faculty of Information Technology BUT

Location

Mikulov

ISBN

80-214-3287-X

Book

MEMICS 2006 Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science

Pages from

214

Pages to

221

Pages count

8

BibTex

@inproceedings{BUT22277,
  author="Rudolf {Schönecker} and Zbyněk {Křivka} and Alexandr {Meduna}",
  title="Reducing Deep Pushdown Automata and Infinite Hierarchy",
  booktitle="MEMICS 2006 Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
  year="2006",
  pages="214--221",
  publisher="Faculty of Information Technology BUT",
  address="Mikulov",
  isbn="80-214-3287-X"
}