Recursively Enumerable Languages
| > | P:=table():P[[S]]:={[a,A,b]}: P[[a,A]]:={[a,A,b],[\lambda]}:
csg:=UG({S,A},{a,b},S,op(P)); |
![`:=`(csg, UG({S, A}, {a, b}, S, TABLE([[a, A] = {[a, A, b], [lambda]}, [S] = {[a, A, b]}])))](images/FOLA-demo_1722.gif){kind=small} |
(15.1) |
| > |
Recursively Enumerable Languages
| > | P:=table():P[[S]]:={[a,A,b]}: P[[a,A]]:={[a,A,b],[\lambda]}:
csg:=UG({S,A},{a,b},S,op(P)); |
|
(15.1) |
| > |