From bounded T-systems to 1-safe T-systemsup to language equivalence
Abstract
We show that every finite and bounded marked graph or T-system has a 1-safe labelled version with an identical language.
INRIA.HAL.SCIENCE Web Portal Publications, softwares... of Inria fellow Academics |
Rapport De Recherche Inria : Connect in order to contact the contributor
https://inria.hal.science/inria-00071878
Submitted on : Tuesday, May 23, 2006-7:04:28 PM
Last modification on : Tuesday, April 25, 2023-3:04:06 PM
Long-term archiving on: Sunday, April 4, 2010-10:42:35 PM