Informatik (Subject) / Test 4. Semester (Lesson)
There are 5 cards in this lesson
Endliche nichtdeterministische Automaten
This lesson was created by Sebi2030.
This lesson is not released for learning.
- Eingabealphabet Σ = {m, n}
- Zustandsmenge Q = {q0, q1, q2}
- Endzustände F = {q2}
- Startzustand s = q0
- Ausgabealphabet Ω = { B, N}