Crowdly
Add to Chrome
THLR 2026
Looking for THLR 2026 test answers and solutions? Browse our comprehensive collection of verified answers for THLR 2026 at moodle-exam.epita.fr.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
[FR] Quelle propriété doit être vérifiée par un automate déterministe ?
[EN] One of these properties must be verified by a deterministic automaton. Which one?[FR] Un état utile d'un automate :
[EN] An useful state of an automaton:
[FR] Combien y a t-il d'états utiles dans l'automate ci-dessous ?
Cette question vaut 2 points.
[EN] How many useful states does the automaton below feature?
This question is worth 2 points.
[FR] Soit un langage ne vérifiant pas le lemme de pompage. Alors :
[EN] Let be a language that doesn't verify the pumping lemma. Then :
[FR] Pour toutes expressions régulières , on a .
[EN] For all regular expressions , we claim that .
[FR] Un automate rejette un mot si et seulement si :
[EN] An automaton rejects a word if and only if:
[FR] Soit un langage rationnel, alors est récursivement énumérable.
[EN] If is a rational language, then it is also recursively enumerable.
[FR] Soit un mot. Que vaut ?
[EN] Let be a word. is equal to: