Publication detail

Prefix Pushdown Automata

MEDUNA, A.

Original Title

Prefix Pushdown Automata

Type

journal article - other

Language

English

Original Abstract

The present paper demonstrates this result for some simplified versions of prefix pushdown automata. Finally, it discusses the descriptional complexity of these automata.

Keywords

prefix pushdown automata, pushdown, recursively enumerable languages

Authors

MEDUNA, A.

Released

1. 1. 1999

Publisher

unknown

Location

London

ISBN

0020-7160

Periodical

International Journal of Computer Mathematics

Year of study

1999

Number

71

State

United Kingdom of Great Britain and Northern Ireland

Pages from

1

Pages to

20

Pages count

20

BibTex

@article{BUT191795,
  author="Alexandr {Meduna}",
  title="Prefix Pushdown Automata",
  journal="International Journal of Computer Mathematics",
  year="1999",
  volume="1999",
  number="71",
  pages="1--20",
  issn="0020-7160"
}