Number of the records: 1
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences
- 1.
SYSNO 0362865 Title Complexity 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 Type Konferenční příspěvek (zahraniční konf.) Grant GAP202/10/1333 GA ČR - Czech Science Foundation (CSF) CEZ AV0Z10300504 - UIVT-O (2005-2011) Language eng Country DE Keywords multitape computations * crossing sequences * nondeterministic simulation Permanent Link http://hdl.handle.net/11104/0199046 File Download Size Commentary Version Access a0362865.pdf 0 279.2 KB Publisher’s postprint require
Number of the records: 1