Počet záznamů: 1
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences
SYS 0362865 LBL 01649^^^^^2200205^^^450 005 20240103195424.5 014 $a 79961191016 $2 SCOPUS 017 7-
$a 10.1007/978-3-642-22600-7_25 $2 DOI 100 $a 20110819d m y slo 03 ba 101 0-
$a eng 102 $a DE 200 1-
$a Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences 215 $a 14 s. 463 -1
$1 001 cav_un_epca*0362864 $1 010 $a 978-3-642-22599-4 $1 011 $a 0302-9743 $1 200 1 $a Description Complexity of Formal Systems $v S. 314-327 $1 210 $a Berlin $c Springer $d 2011 $1 225 $a Lecture Notes in Computer Science $v 6808 $1 702 1 $a Holzer $b M. $4 340 $1 702 1 $a Kutrib $b M. $4 340 $1 702 1 $a Pighizzini $b G. $4 340 610 0-
$a multitape computations 610 0-
$a crossing sequences 610 0-
$a nondeterministic simulation 700 -1
$3 cav_un_auth*0100858 $a Wiedermann $b Jiří $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $p UIVT-O $w Department of Machine Learning $4 070 $T Ústav informatiky AV ČR, v. v. i.
Počet záznamů: 1