Directed graphs represented with formal grammar
-
15-10-2022 - |
Вопрос
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?
Нет правильного решения
Не связан с StackOverflow