Publication Details

A Reduction of Finitely Expandable Deep Pushdown Automata

CHARVÁT, L.; MEDUNA, A. A Reduction of Finitely Expandable Deep Pushdown Automata. Schedae Informaticae, 2018, vol. 2017, no. 26, p. 61-68. ISSN: 0860-0295.
Czech title
Redukce konečně expandovatelných hlubokých zásobníkových automatů
Type
journal article
Language
English
Authors
Charvát Lucie, Ing.
Meduna Alexandr, prof. RNDr., CSc. (DIFS)
URL
Keywords

Deep Pushdown Automata, Finite Expandability, Reduction, Non-Input Pushdown Symbols

Abstract

For a positive integer n, n-expandable deep pushdown automata always contain no more than n occurrences of non-input symbols in their pushdowns during any computation. As its main result, the paper demonstrates that these automata are as powerful as the same automata with only two non-input pushdown symbols---$ and #, where # always appears solely as the pushdown bottom. Moreover, the paper demonstrates an infinite hierarchy of language families that follows from this main result. The paper also points out that if # is the only non-input symbol in these automata, then they characterize the family of regular languages.

Published
2018
Pages
61–68
Journal
Schedae Informaticae, vol. 2017, no. 26, ISSN 0860-0295
DOI
10.4467/20838476SI.17.005.8151
EID Scopus
2-s2.0-85057858123
BibTeX 
@article{BUT157232,
  author="Lucie {Charvát} and Alexandr {Meduna}",
  title="A Reduction of Finitely Expandable Deep Pushdown Automata",
  journal="Schedae Informaticae",
  year="2018",
  volume="2017",
  number="26",
  pages="61--68",
  doi="10.4467/20838476SI.17.005.8151",
  issn="0860-0295",
  url="http://www.ejournals.eu/Schedae-Informaticae/2017/Volume-26/art/10836/"
}
Back to top