[英]Is there an efficient algorithm to decide whether the language accepted by one NFA is a superset of the language accepted by another?
給定兩個非確定性有限自動機M1和M2 ,是否有一種有效的算法來確定M1接受的語言是否是M2接受的語言的超集?
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.