algorithms
http://tau-cm2014.wikidot.com/forum/t-830254/algorithms
Posts in the discussion thread "algorithms"Mon, 23 Sep 2019 12:13:11 +0000http://tau-cm2014.wikidot.com/forum/t-830254#post-1997589(no title)
http://tau-cm2014.wikidot.com/forum/t-830254/algorithms#post-1997589
Mon, 24 Mar 2014 15:10:34 +0000Asya
It's just a DFA, you don't know anything you have to check. But you do know that the number of states is finite. The hint is the pumping lemma, think about it in terms of: if a word of size larger then n is excepted, what can you say about the automata? and how much words to check, what is sufficent?
]]>
http://tau-cm2014.wikidot.com/forum/t-830254#post-1997421algorithms
http://tau-cm2014.wikidot.com/forum/t-830254/algorithms#post-1997421
Mon, 24 Mar 2014 10:16:43 +0000noam
When it stated that I've been given a DFA, what exactly do I know about it? do I know its number of states? its pumping length? whether it has cycles?
]]>