Example 6.4.1.Consider a language equation system with unknown X: X = ab + aXb.
The language _ is not a solution of this system since _ {ab} _ {a}_{b}.
No finite language can be a solution.
The language (a+b)* is not a solution of this system since (a+b)* {ab} _ {a} (a+b)* {b}.
The language {anbn | n1} is a solution of this systemsince {anbn | n1} = {ab} _ {a}{anbn | n1} }{b}.
So this system is consistent. Does it have any othersolutions?
Previous slide | Next slide | Back to first slide | View graphic version |