Publication detail

Simultaneously One-Turn Two-Pushdown Automata

MEDUNA, A.

Original Title

Simultaneously One-Turn Two-Pushdown Automata

Type

journal article - other

Language

English

Original Abstract

It is proved that simultaneously one-turn two-pushdown automata are equivalent to the Turing machines.

Keywords

recursively enumerable languages, one-turn two-pushdown automata

Authors

MEDUNA, A.

RIV year

2002

Released

18. 2. 2003

Publisher

Taylor & Francis Informa plc

Location

London

ISBN

0020-7160

Periodical

International Journal of Computer Mathematics

Year of study

2003

Number

80

State

United Kingdom of Great Britain and Northern Ireland

Pages from

679

Pages to

687

Pages count

9

BibTex

@article{BUT41080,
  author="Alexandr {Meduna}",
  title="Simultaneously One-Turn Two-Pushdown Automata",
  journal="International Journal of Computer Mathematics",
  year="2003",
  volume="2003",
  number="80",
  pages="679--687",
  issn="0020-7160"
}