*001405367
*00520160622155433.0
*007ta
*008120413s2010    no#           000 u eng
*00901085cam a2200265 c 4500
*015  $a1122015$2nbf
*019  $bl
*035  $a(EXLNZ-47BIBSYS_NETWORK)991021384354702201
*035  $a(NO-LaBS)13406287(bibid)
*035  $a(NO-TrBIB)102138435
*035  $a102138435-47bibsys_network
*040  $aNO-OsNB$bnob$ekatreg
*042  $anorbibl
*044  $cno
*1001 $aGrimsmo, Nils$d1980-$0(NO-TrBIB)8002787$4aut$_109751000
*24510$aLinear Computation of the Maximum Simultaneous Forward and Backward Bisimulation for Node-Labeled Trees (Extended version)$cNils Grimsmo, Truls Amundsen Bjørklund and Magnus Lie Hetland
*260  $aTrondheim$bNorwegian University of Science and Technology, Department of Computer and Information Science$c2010
*300  $a[23] s.
*4901 $aTechnical report$vIDI-TR-10/2010
*7001 $aBjørklund, Truls Amundsen$d1981-$0(NO-TrBIB)8002802$4aut$_270708400
*7001 $aHetland, Magnus Lie$d1974-$0(NO-TrBIB)2097916$4aut$_56013800
*830 0$aIDI-rapport (trykt utg.)$x1503-416x$vIDI-TR-10/2010$w999708930194702201$_13216900
*901  $a90
*913  $aNorbok$bNB
*999  $aoai:nb.bibsys.no:991021384354702202$b2021-11-14T20:18:11Z$z991021384354702202
^