Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Traces of term-automatic graphs

Antoine Meyer — 2008

RAIRO - Theoretical Informatics and Applications

In formal language theory, many families of languages are defined using either grammars or finite acceptors. 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...

Page 1

Download Results (CSV)