Number of the records: 1  

Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences

  1. 1.
    SYSNO0362865
    TitleComplexity of Nondeterministic Multitape Computations Based on Crossing Sequences
    Author(s) Wiedermann, Jiří (UIVT-O) RID, SAI, ORCID
    Source Title Description Complexity of Formal Systems. S. 314-327. - Berlin : Springer, 2011 / Holzer M. ; Kutrib M. ; Pighizzini G.
    Conference DCFS 2011. International Workshop on Descriptional Complexity of Formal Systems /13./, Giessen, 25.07.2011-27.07.2011
    Document TypeKonferenční příspěvek (zahraniční konf.)
    Grant GAP202/10/1333 GA ČR - Czech Science Foundation (CSF)
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    Languageeng
    CountryDE
    Keywords multitape computations * crossing sequences * nondeterministic simulation
    Permanent Linkhttp://hdl.handle.net/11104/0199046
    FileDownloadSizeCommentaryVersionAccess
    a0362865.pdf0279.2 KBPublisher’s postprintrequire
     
Number of the records: 1  

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