Request file

Review/Citation:  WIEDERMANN, Jiří. Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences. In: HOLZER, M., KUTRIB, M., PIGHIZZINI, G., eds. Description Complexity of Formal Systems. Berlin: Springer, 2011, s. 314-327. Lecture Notes in Computer Science, 6808. ISBN 978-3-642-22599-4. ISSN 0302-9743
Requested document:  a0362865.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.

Fields marked with * are obligatory.

(Universities, research institutions, associations …)

a0362865.pdf

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.