Počet záznamů: 1
Complexity in union-free regular languages
SYS 0369498 LBL 01596^^^^^2200289^^^450 005 20240103200052.7 014 $a 000297580200011 $2 WOS 014 $a 82955228052 $2 SCOPUS 017 $a 10.1142/S0129054111008933 $2 DOI 100 $a 20120106d m y slo 03 ba 101 0-
$a eng $d eng 102 $a SG 200 1-
$a Complexity in union-free regular languages 215 $a 15 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č. 22, č. 7 (2011), s. 1639-1653 610 0-
$a Union-free regular language 610 0-
$a one-cycle-free-path automaton 610 0-
$a descriptional complexity 700 -1
$3 cav_un_auth*0263752 $a Jirásková $b G. $y SK $4 070 701 -1
$3 cav_un_auth*0262819 $a Masopust $b Tomáš $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $w Mathematical Logic and Theoretical Computer Science $4 070 $T Matematický ústav AV ČR, v. v. i. 856 $u http://www.worldscinet.com/ijfcs/22/2207/S0129054111008933.html
Počet záznamů: 1