Number of the records: 1
Complexity in Union-Free Regular Languages
SYS 0346729 LBL 01525^^^^^2200241^^^450 005 20240103193808.8 014 $a 000286402700024 $2 WOS 014 $a 78049312270 $2 SCOPUS 017 70
$a 10.1007/978-3-642-14455-4_24 $2 DOI 100 $a 20100907d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a Complexity in Union-Free Regular Languages 215 $a 12 s. 463 -1
$1 001 cav_un_epca*0346728 $1 010 $a 978-3-642-14455-4 $1 200 1 $a Developments in Language Theory $v S. 255-266 $1 210 $a Berlin $c Springer $d 2010 $1 225 $a Lecture Notes in Computer Science $v 6224 $1 702 1 $a Gao $b Y. $4 340 $1 702 1 $a Lu $b H. $4 340 $1 702 1 $a Seki $b S. $4 340 610 0-
$a descriptional complexity 610 0-
$a union-free regular language 610 0-
$a one-cycle-free-path finite automaton 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://link.springer.com/chapter/10.1007%2F978-3-642-14455-4_24
Number of the records: 1