Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Alex Spelten"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 73, Iss Proc. INFINITY 2011, Pp 20-34 (2011)
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the tree itera
Externí odkaz:
https://doaj.org/article/e1f6ca3c99ef46b6b440587771c3fb3f
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 73, Iss Proc. INFINITY 2011, Pp 20-34 (2011)
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the tree iterati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dcd55f12f106e394fe526177c63c57d
http://arxiv.org/abs/1111.3107
http://arxiv.org/abs/1111.3107
Autor:
Christof Löding, Alex Spelten
Publikováno v:
Mathematical Foundations of Computer Science 2007 ISBN: 9783540744559
MFCS
MFCS
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. For the first, we construct a reduction to ranked trees via an encoding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfbd719bf560d09e48249accf3cb1ab9
https://doi.org/10.1007/978-3-540-74456-6_8
https://doi.org/10.1007/978-3-540-74456-6_8