0
1.0kviews
convert the following grammar into finite automata S - ax|by|a|b X - as|by|b y - ax|bs
written 6.5 years ago by | • modified 6.5 years ago |
Subject: Theory of Computer Science
Topic: Basic Concepts & Finite Automata
Difficulty: Medium
ADD COMMENT
EDIT
1 Answer