Publication detail

Simultaneously One-Turn Two-Pushdown Automata

MEDUNA, A.

Original Title

Simultaneously One-Turn Two-Pushdown Automata

English Title

Simultaneously One-Turn Two-Pushdown Automata

Type

journal article - other

Language

en

Original Abstract

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

English abstract

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

Keywords

automata

RIV year

2002

Released

18.11.2002

Publisher

Taylor & Francis Informa plc

Location

London

Pages from

111

Pages to

121

Pages count

10

BibTex


@article{BUT41080,
  author="Alexandr {Meduna}",
  title="Simultaneously One-Turn Two-Pushdown Automata",
  annote="It is proved that simultaneously one-turn two-pushdown automata are equivalent to the Turing machines.",
  address="Taylor & Francis Informa plc",
  booktitle="International Journal of Computer Mathematics",
  chapter="41080",
  institution="Taylor & Francis Informa plc",
  number="80",
  volume="2002",
  year="2002",
  month="november",
  pages="111--121",
  publisher="Taylor & Francis Informa plc",
  type="journal article - other"
}