Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

MFCS

2007

Springer

2007

Springer

In formal language theory, many families of languages are deﬁned using grammars or ﬁnite acceptors like pushdown automata and Turing machines. For instance, context-sensitive languages are the languages generated by growing grammars, or equivalently those accepted by Turing machines whose work tape’s size is proportional to that of their input. A few years ago, a new characterisation of context-sensitive languages as the sets of traces, or path labels, of rational graphs (inﬁnite graphs deﬁned by sets of ﬁnite-state transducers) was established. We investigate a similar characterisation in the more general framework of graphs deﬁned by term transducers. In particular, we show that the languages of term-automatic graphs between regular sets of vertices coincide with the languages accepted by alternating linearly bounded Turing machines. As a technical tool, we also introduce an arborescent variant of tiling systems, which provides yet another characterisation of these lang...

Related Content

Added |
08 Jun 2010 |

Updated |
08 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
MFCS |

Authors |
Antoine Meyer |

Comments (0)