Search for tag: "remainder"

CL - 15a - Regular Languages (III) : DFA-regular

Our third definition: we say a language is DFA-regular if it is the language recognised by some DFA.We show that the complement of a DFA-regular language is DFA-regular.

From  Haoran Peng 0 likes 358 plays 0  

19a

Execution Monitoring and Re-planning

From  Alexandra Lascarides 0 likes 171 plays 0