[英]Determine the language describe by the CFG
S -> 1A A -> 0B | 1A | epsilon B -> 0C | 1B C -> 0A | 1C
我以為該語法描述的語言如下:L = {0,1 | w字符串包含1+或至少具有三個0'}
這看起來正確嗎?
這是常規CFG,因此其DFA如下:
這是一種由字母= {0,1}組成的語言,該語言接受一個1或多個1如果輸入0則需要3 (0)才能進入最終語言。在這個多個1 ,每0.
{0,1}
1
0
(0)
0.
[英]CFG for language
[英]What is the language described by this CFG?
[英]Generating CFG for a Language
[英]Automata: CFG for following language
[英]Some constraint on Language and CFG
[英]CFG to define a language
[英]Create a CFG for language
[英]Is the given language a valid CFG?
[英]Is a CFG using a nil language decidable?
[英]How to find the language generated by a CFG
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.