Počet záznamů: 1
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences
- 1.Wiedermann, Jiří
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences.
Description Complexity of Formal Systems. Berlin: Springer, 2011 - (Holzer, M.; Kutrib, M.; Pighizzini, G.), s. 314-327. Lecture Notes in Computer Science, 6808. ISBN 978-3-642-22599-4. ISSN 0302-9743.
[DCFS 2011. International Workshop on Descriptional Complexity of Formal Systems /13./. Giessen (DE), 25.07.2011-27.07.2011]
http://hdl.handle.net/11104/0199046
Počet záznamů: 1