Publication detail

Simultaneously One-Turn Two-Pushdown Automata

MEDUNA, A.

Czech title

Souběžně jednoobrátkové dvouzásobníkové automaty.

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.

Czech abstract

Souběžně jednoobrátkové dvouzásobníkové automaty jsou zkoumány.

English abstract

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

Keywords in Czech

Souběžně jednoobrátkové dvouzásobníkové automaty jsou zkoumány

Keywords in English

recursively enumerable languages, one-turn two-pushdown automata

RIV year

2002

Released

18.02.2003

Publisher

Taylor & Francis Informa plc

Location

London

ISSN

0020-7160

Book

International Journal of Computer Mathematics

Volume

2003

Number

80

Pages from–to

679–687

Pages count

9

BIBTEX


@article{BUT41080,
  author="Alexandr {Meduna},
  title="Simultaneously One-Turn Two-Pushdown Automata",
  booktitle="International Journal of Computer Mathematics",
  year="2003",
  volume="2003",
  number="80",
  month="February",
  pages="679--687",
  publisher="Taylor & Francis Informa plc",
  address="London",
  issn="0020-7160"
}