Close
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
jump to main content
Search Details
Quicksearch:
OK
Result-List
Title
Title
Content
Content
Page
Page
The search-operation requires javascript to be activated.
The search-operation requires javascript to be activated.
The search-operation requires javascript to be activated.
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
Files
The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
[
pdf
0.45 mb
]
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
260
times.
License/Rightsstatement
In Copyright
The search-operation requires javascript to be activated.
