%0 Conference Proceedings
%F ncma10
%A Morvan, C.
%T Contextual graph grammars characterising Rational Graphs
%B Non-Classical Models of Automata and Applications (NCMA)
%P 141-153
%C Jena, Germany
%X Deterministic graph grammars generate a family of infinite graphs which characterise context- free (word) languages. The present paper introduces a context-sensitive extension of these gram- mars. We prove that this extension characterises rational graphs (whose traces are context- sensitive languages). We illustrate that this extension is not straightforward: the most obvious context-sensitive graph rewriting systems generate non recursive infinite graphs
%U http://www.irisa.fr/vertecs/Publis/Ps/ncma10.pdf
%8 August
%D 2010