de
en
Close
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
jump to main content
Search Details
Quicksearch:
OK
Title
Title
Content
Content
Page
Page
Bibliographic Metadata
Title
The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
Author
Monien, Burkhard
Is part of
Acta Informatica, 1977, Vol. 8.1977, page 371-382
Place and Date of Creation
2009
Language
English
Document Types
Journal Article
ISSN
0001-5903
URN
urn:nbn:de:hbz:466:2-4357
Links
Social Media
Share
Reference
Universitätsbibliothek Paderborn
IIIF
IIIF Manifest
Download
The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
[
461.60 kb
]
ris
Classification
Besondere Sammlungen
Veröffentlichungen der Universität
Fakultät für Elektrotechnik, Informatik und Mathematik
Institut für Informatik
Klassifikation (DDC)
Informatik, Informationswissenschaft, allgemeine Werke
Informatik, Wissen, Systeme
Informatik, Informationswissenschaft, allgemeine Werke
Content
Contents of this Book
Stats
The PDF-Document has been downloaded
46
times.
License/Rightsstatement
In Copyright