Number of the records: 1
Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth
SYS 0476164 LBL 01000a^^22220027750^450 005 20240103214246.2 014 $a 85014629211 $2 SCOPUS 017 $a 10.4230/LIPIcs.IPEC.2016.25 $2 DOI 100 $a 20170714d m y slo 03 ba 101 $a eng $d eng 102 $a DE 200 1-
$a Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth 215 $a 12 s. $c E 463 -1
$1 001 cav_un_epca*0476165 $1 010 $a 978-3-95977-023-1 $1 011 $a 1868-8969 $1 200 1 $a 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) $v S. 1-12 $1 205 $a 1. $1 210 $a Dagstuhl $c Schloss Dagstuhl, Leibniz-Zentrum für Informatik $d 2017 $1 225 $a Leibniz International Proceedings in Informatics $v 63 $1 702 1 $a Guo $b J. $4 340 $1 702 1 $4 340 $a Hermelin $b D. 610 $a linear term rewriting systems 610 $a ground reachability 610 $a ground joinability 610 $a fixed parameter tractability 700 -1
$3 cav_un_auth*0325257 $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $4 070 $a de Oliveira Oliveira $b Mateus $p MU-W $y SE $T Matematický ústav AV ČR, v. v. i. 856 $u http://drops.dagstuhl.de/opus/volltexte/2017/6925/
Number of the records: 1