Počet záznamů: 1
Separating the Classes of Recursively Enumerable Languages Based on Machine Size
SYS 0449858 LBL 01107^^^^^2200301^^^450 005 20240103211111.0 014 $a 84947257202 $2 SCOPUS 014 $a 000364655800002 $2 WOS 017 70
$a 10.1142/S0129054115500380 $2 DOI 100 $a 20151109d m y slo 03 ba 101 0-
$a eng 102 $a SG 200 1-
$a Separating the Classes of Recursively Enumerable Languages Based on Machine Size 215 $a 19 s. 463 -1
$1 001 cav_un_epca*0079195 $1 011 $a 0129-0541 $e 1793-6373 $1 200 1 $a International Journal of Foundations of Computer Science $v Roč. 26, č. 6 (2015), s. 677-695 610 0-
$a recursively enumerable languages 610 0-
$a RE hierarchy 610 0-
$a finite languages 610 0-
$a machine size 610 0-
$a descriptional complexity 610 0-
$a Turing machines with advice 700 -1
$3 cav_un_auth*0019196 $4 070 $a van Leeuwen $b J. $y NL 701 -1
$3 cav_un_auth*0100858 $4 070 $a Wiedermann $b Jiří $p UIVT-O $i Oddělení fundamentálních témat $j Department of Fundamental Topics $w Department of Machine Learning $T Ústav informatiky AV ČR, v. v. i.
Počet záznamů: 1