Language Analyzer
Regex → NFA/DFA → PDA → Turing Machine
Regular Expression
Input String
Language Type
Regular
Context-Free
Turing
Analyze
Presets:
ends with abb
a*b*
aⁿbⁿ (CFG)
Palindrome (TM)
① Regular (NFA/DFA)
② Context-Free (PDA)
③ Turing Machine
Click "Analyze" to start
Select "Context-Free" and click "Analyze"
Select "Turing Machine" and click "Analyze"