Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Rémy Gilleron"'
Autor:
Sophie Tison, Rémy Gilleron
Publikováno v:
Fundamenta Informaticae. 24:157-175
We present a collection of results on regular tree languages and rewrite systems. Moreover we prove the undecidability of the preservation of regularity by rewrite systems. More precisely we prove that it is undecidable whether or not for a set E of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d77e2ea15d6bad4d03219c367916673
https://doi.org/10.3233/fi-1995-24127
https://doi.org/10.3233/fi-1995-24127
