Directed graphs represented with formal grammar

StackOverflow https://stackoverflow.com/questions/21972209

Pergunta

Is it possible to represent arbitrary directed graphs (with labeled edges) with a formal grammar, for example a context-sensitive grammar? If it is possible, is there a proof where you can read this up?

Nenhuma solução correta

Licenciado em: CC-BY-SA com atribuição
Não afiliado a StackOverflow
scroll top