Detail publikace

Simultaneously One-Turn Two-Pushdown Automata

Originální název

Simultaneously One-Turn Two-Pushdown Automata

Anglický název

Simultaneously One-Turn Two-Pushdown Automata

Jazyk

en

Originální abstrakt

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

Anglický abstrakt

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

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"
}