A max-plus tree automaton is called unambiguous if there is at most one accepting run on every tree. ... 中文翻译: ...
確定! 回上一頁