Problem 1
(aa+bb)(a+b)*(a+b+ab+ba)(a+b+ab+ba)*(aa+bab)*(a+b+aa)(a+b+bb+aa)*
DFA
Deterministic finite automaton. Drag a state to move it.
ε (empty string)
Enter a string, then Simulate or Validate.
CFG
Context-free grammar that generates the same language.
- S
- TUVWXYZ
- T
- aa |bb
- U
- aU |bU |ε
- V
- a |b |ab |ba
- W
- aW |bW |abW |baW |ε
- X
- aaX |babX |ε
- Y
- a |b |aa
- Z
- aZ |bZ |bbZ |aaZ |ε
PDA
Pushdown automaton as a flowchart.
ε (empty string)
Enter a string, then Simulate or Validate.