Directed graphs represented with formal grammar

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

문제

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?

올바른 솔루션이 없습니다

라이센스 : CC-BY-SA ~와 함께 속성
제휴하지 않습니다 StackOverflow
scroll top