Traces of Term Automatic Graphs 1st Edition by Antoine Meyer ISBN 9783540744566

 Traces of Term Automatic Graphs 1st Edition by Antoine Meyer – Ebook PDF Instant Download/Delivery. 9783540744566
Full download Traces of Term Automatic Graphs 1st Edition after payment

Product details:

ISBN 10: 
ISBN 13: 9783540744566
Author: Antoine Meyer

In formal language theory, many families of languages are defined using grammars or finite 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 (infinite graphs defined by sets of finite-state transducers) was established.

We investigate a similar characterisation in the more general framework of graphs defined 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 languages.

 Traces of Term Automatic Graphs 1st Table of contents:

1 Notations
2 Arborescent tiling systems
3 Traces of term-automatic graphs
4 Conclusion

People also search for Traces of Term Automatic Graphs 1st :

traces of term-automatic graphs
    
trace of a graph
    
traces in math
    
graph trace analysis
    
a(t) graph