Slide 13
Slide 13 text
Dr. Javier Gonzalez-Sanchez | Compilers | 13
jgs
Question
For each case, indicate whether it is possible to generate a Deterministic Finite Automaton (DFA).
1. Can a DFA detect the balance of N parentheses in a string that contains N nested parentheses with
any characters in between?
2. Is it possible for a DFA to recognize binary strings that contain an equal number of 0s and 1s,
regardless of their order or sequence?