最終更新日：2022/12/24
There is a pumping lemma for CFLs similar to the one for regular sets. It can be used in the same way to show that certain sets are not context-free.
編集履歴（0）
There is a pumping lemma for CFLs similar to the one for regular sets. It can be used in the same way to show that certain sets are not context-free.
DiQt（ディクト）
無料
★★★★★★★★★★
