And owl naturally breaks down grammars, similar to CFG. Regular expressions can also be broken down - by their recursive definition - but curiously they never

And owl naturally breaks down grammars, similar to CFG. Regular expressions can also be broken down - by their recursive definition - but curiously they never seem to be, in pratice. e.g. E = ab+bc F = x+y EF = (ab+bc)(x+y)