The synchronized graphs trace the context-sensitive languages
Abstract
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs de ned by transducers with labelled nal states. We prove that this result is still true if we restrict to the traces of graphs de ned by synchronized transducers with labelled nal states. From their construction, we deduce that the context-sensitive languages are the languages of path labels leading from and to rational vertex sets of letter-to-letter rational graphs.
Origin : Files produced by the author(s)
Loading...