4 search results - page 1 / 1 » The synchronized graphs trace the context-sensitive language... |
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
ENTCS
2002
13 years 4 months ago
2002
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result ...
ACTA
2005
13 years 4 months ago
2005
In the hierarchy of infinite graph families, rational graphs are defined by rational transducers with labelled final states. This paper proves that their traces are precisely conte...
ICFP
2010
ACM
13 years 5 months ago
2010
ACM
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...