0
1.0kviews
convert the following grammar into finite automata S - ax|by|a|b X - as|by|b y - ax|bs

Subject: Theory of Computer Science

Topic: Basic Concepts & Finite Automata

Difficulty: Medium

1 Answer
0
2views

i) There are no ϵ moves so we can directly solve step ii)

ii) every symbol in α is production of the form where |α|2 should be a variable

This can be done by adding 2 production

caa cbb

The production set becomes often changes

S- …

Create a free account to keep reading this post.

and 4 others joined a min ago.

Please log in to add an answer.