january 02, 2021   admin 11

Grammars in Automata Theory

Grammar can defined as 4 tuples, it means G={N,T,S,P} where, N- set of variables or non terminal symbol T- terminal symbol S- starting symbol, S ∊ N P- production rule for terminal or non-terminal (∝➝β)

read more