Equivalence of regular expressions with converse on relations

Transcription

Equivalence of regular expressions with converse on relations
Equivalence of regular expressions with converse on
relations
An alternative presentation of the proof by Bloom, Ésik and Stefanescu
Paul Brunet and Damien Pous
ENS de Lyon
17 juin 2013
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
1 / 22
Converse
Converse on languages : Mirror
1∨ ≔ 1
∨
(x · w ) ≔ w ∨ · x
L∨ ≔ {w ∨ | w ∈ L}
Converse on relations
R ∨ ≔ {(y , x ) | (x , y ) ∈ R}
a
b
c
d
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
2 / 22
Converse
Converse on languages : Mirror
1∨ ≔ 1
∨
(x · w ) ≔ w ∨ · x
L∨ ≔ {w ∨ | w ∈ L}
Converse on relations
R ∨ ≔ {(y , x ) | (x , y ) ∈ R}
a
b
c
d
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
2 / 22
Plan
1
Kleene Algebrae with converse
2
Construction of the closure of an automaton
3
On examples
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
3 / 22
CKA
Table of Contents
1
Kleene Algebrae with converse
2
Construction of the closure of an automaton
3
On examples
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
4 / 22
CKA
Equivalence
We’ll use different notions of equivalence on expressions e, f on an alphabet X :
We write ~e for the language denoted by a regular expression e.
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
5 / 22
CKA
Equivalence
We’ll use different notions of equivalence on expressions e, f on an alphabet X :
Language equality : ~e = ~f  ;
We write ~e for the language denoted by a regular expression e.
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
5 / 22
CKA
Equivalence
We’ll use different notions of equivalence on expressions e, f on an alphabet X :
Language equality : ~e = ~f  ;
Equivalence for language models : ∀Σ, ∀σ ∈ Σ∗ X , σ̂(e) = σ̂(f ) : e ≡Lang f ;
We write ~e for the language denoted by a regular expression e.
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
5 / 22
CKA
Equivalence
We’ll use different notions of equivalence on expressions e, f on an alphabet X :
Language equality : ~e = ~f  ;
Equivalence for language models : ∀Σ, ∀σ ∈ Σ∗ X , σ̂(e) = σ̂(f ) : e ≡Lang f ;
X
Equivalence for relation models : ∀S, ∀σ ∈ P S 2 , σ̂(e) = σ̂(f ) : e ≡Rel f .
We write ~e for the language denoted by a regular expression e.
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
5 / 22
CKA
Kleene Algebrae I
A Kleene Algebra (i) is an algebraic structure hK , +, ·,∗ , 0, 1i satifying :
1
hK , +, ·, 0, 1i is an idempotent semiring :

a + (b + c) = (a + b) + c
hK , +, 0i is a 


a+b =b+a
commutative
a+0=a
idempotent



a
monoid
 +a =a
 a(bc) = (ab)c
hK , ·, 1i is a
1a = a
monoid

 a1 = a
a(b + c) = ab + ac



(a + b)c = ac + bc
Distributivity
0a
=0
laws



a0 = 0
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
6 / 22
CKA
Kleene Algebrae II
2
The
∗
operation satisfy :
1 + aa∗ 6 a∗
1 + a∗ a 6 a∗
b + ax 6 x ⇒ a∗ b 6 x
b + xa 6 x ⇒ ba∗ 6 x
∆
Where a 6 b ⇐
⇒ a + b = b.
The last axioms can be replaced by a number of things.
(i). As presented in [Koz94].
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
7 / 22
CKA
All is well
~e = ~f 
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
8 / 22
CKA
All is well
~e = ~f  ⇔
Paul Brunet and Damien Pous (ENS de Lyon)
KA ⊢ e = f
Decidability in REL∨
17 juin 2013
8 / 22
CKA
All is well
~e = ~f  ⇔
Paul Brunet and Damien Pous (ENS de Lyon)
KA ⊢ e = f
⇔ e ≡Lang f
Decidability in REL∨
17 juin 2013
8 / 22
CKA
All is well
~e = ~f  ⇔
Paul Brunet and Damien Pous (ENS de Lyon)
KA ⊢ e = f
⇔ e ≡Lang f
Decidability in REL∨
⇔
e ≡Rel f
17 juin 2013
8 / 22
CKA
Kleene Algebra with Converse
Theorem [BES95]
A complete axiomatization of the variety L∨ generated by regular languages with
converse consists of the axioms for KA and the following :
∨
(a + b) = a∨ + b ∨
∨
(a · b) = b ∨ · a∨
∨
(a∗ ) = (a∨ )∗
∨
a∨ = a.
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
9 / 22
CKA
Equivalence in L∨
Let e, f ∈ Reg ∨ (X ).
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
10 / 22
CKA
Equivalence in L∨
Let e, f ∈ Reg ∨ (X ).
We compute τ (e), τ (f ) ∈ Reg(X ∪ X ′ ).
Where ∀x ∈ X , τ (x ) = x
and
∀x ∈ X , ν(x ) = x ′
ν(1) = 1
τ (1) = 1
ν(e1 · e2 ) = ν(e2 ) · ν(e1 )
τ (e1 · e2 ) = τ (e1 ) · τ (e2 )
τ (e1 + e2 ) = τ (e1 ) + τ (e2 ) ν(e1 + e2 ) = ν(e1 ) + ν(e2 )
τ (e ∗ ) = τ (e)∗
ν(e ∗ ) = ν(e)∗
∨
τ (e ) = ν(e)
ν(e ∨ ) = τ (e)
′
′
X ≔ {x | x ∈ X } is a disjoint copy of X .
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
10 / 22
CKA
Equivalence in L∨
Let e, f ∈ Reg ∨ (X ).
We compute τ (e), τ (f ) ∈ Reg(X ∪ X ′ ).
Where ∀x ∈ X , τ (x ) = x
and
∀x ∈ X , ν(x ) = x ′
ν(1) = 1
τ (1) = 1
ν(e1 · e2 ) = ν(e2 ) · ν(e1 )
τ (e1 · e2 ) = τ (e1 ) · τ (e2 )
τ (e1 + e2 ) = τ (e1 ) + τ (e2 ) ν(e1 + e2 ) = ν(e1 ) + ν(e2 )
τ (e ∗ ) = τ (e)∗
ν(e ∗ ) = ν(e)∗
∨
τ (e ) = ν(e)
ν(e ∨ ) = τ (e)
′
′
X ≔ {x | x ∈ X } is a disjoint copy of X .
Furthermore
~τ (e) = ~τ (f ) ⇔ e ≡Lang f
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
10 / 22
CKA
Languages vs. Relations
a 6 aa∨ a ???
in L∨
a * aa∨ a = aaa
Paul Brunet and Damien Pous (ENS de Lyon)
in REL∨
if xRy then xRyR ∨ xRy
which means xRR ∨ Ry
so R ⊆ RR ∨ R
Decidability in REL∨
17 juin 2013
11 / 22
CKA
Languages vs. Relations
a 6 aa∨ a ???
in L∨
a * aa∨ a = aaa
in REL∨
if xRy then xRyR ∨ xRy
which means xRR ∨ Ry
so R ⊆ RR ∨ R
Theorem [EB95]
A complete set of axioms for the variety REL∨ generated by regular relations with
converse consists on the axioms for L∨ and the axiom a 6 aa∨ a.
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
11 / 22
CKA
Equivalence in REL∨
Theorem [BES95]
cl(~τ (e)) = cl(~τ (f )) ⇔ e ≡Rel f
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
12 / 22
CKA
Equivalence in REL∨
Theorem [BES95]
cl(~τ (e)) = cl(~τ (f )) ⇔ e ≡Rel f

(X ∪ X ′ )∗



ǫ
Let .̄ be the function
xw



x ′w
Paul Brunet and Damien Pous (ENS de Lyon)
→
7
→
7→
7
→
(X ∪ X ′ )∗
ǫ
wx′
wx
Decidability in REL∨
17 juin 2013
12 / 22
CKA
Equivalence in REL∨
Theorem [BES95]
cl(~τ (e)) = cl(~τ (f )) ⇔ e ≡Rel f

(X ∪ X ′ )∗



ǫ
Let .̄ be the function
xw



x ′w
We define the relation
u
→
7
→
7→
7
→
(X ∪ X ′ )∗
ǫ
wx′
wx
on (X ∪ X ′ )∗ :
∆
v⇐
⇒ ∃u1 , w , u2 : u = u1 w w wu2 ∧ v = u1 wu2 .
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
12 / 22
CKA
Equivalence in REL∨
Theorem [BES95]
cl(~τ (e)) = cl(~τ (f )) ⇔ e ≡Rel f

(X ∪ X ′ )∗



ǫ
Let .̄ be the function
xw



x ′w
We define the relation
u
→
7
→
7→
7
→
(X ∪ X ′ )∗
ǫ
wx′
wx
on (X ∪ X ′ )∗ :
∆
v⇐
⇒ ∃u1 , w , u2 : u = u1 w w wu2 ∧ v = u1 wu2 .
cl(A) is the closure of A for
Paul Brunet and Damien Pous (ENS de Lyon)
: cl(A) = {v | ∃u ∈ A : u
Decidability in REL∨
∗
v }.
17 juin 2013
12 / 22
Construction
Table of Contents
1
Kleene Algebrae with converse
2
Construction of the closure of an automaton
3
On examples
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
13 / 22
Construction
Closure of an automaton
0
a
1
a′
Paul Brunet and Damien Pous (ENS de Lyon)
2
a
3
Decidability in REL∨
17 juin 2013
14 / 22
Construction
Closure of an automaton
a
0
a
1
a′
Paul Brunet and Damien Pous (ENS de Lyon)
2
a
3
Decidability in REL∨
17 juin 2013
14 / 22
Construction
Closure of an automaton
a
0
0
a
a
1
1
a′
a
2
2
a
a′
3
3
a′
4
a
5
a
6
b
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
14 / 22
Construction
Closure of an automaton
a
0
a
1
a′
2
a
3
a
0
a
1
a
2
a′
3
a′
4
a
5
a
6
b
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
14 / 22
Construction
Closure of an automaton
a
0
a′
a
1
a
1
a
2
b
1
a
2
2
0
a
a′
a′
3
a
3
3
a′
a′
4
a
5
a
6
4
a
5
a
6
And it gets worse...
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
14 / 22
Construction
Idea of the construction
If q0
uw
q1
x
q2
wx wx
q3 ,
i.e. pattern wx
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
15 / 22
Construction
Idea of the construction
If q0
uw
q1
x
q2
wx wx
q3 ,
i.e. pattern wx
then : q0 , [ǫ]
uw
Paul Brunet and Damien Pous (ENS de Lyon)
q1 , [uw ]
x
Decidability in REL∨
q3 , [uwx ]
17 juin 2013
15 / 22
Construction
Idea of the construction
If q0
uw
q1
x
wx wx
q2
q3 ,
i.e. pattern wx
then : q0 , [ǫ]
uw
Furthermore, if q0
x
q1 , [uw ]
uw
q1
x
q2
q3 , [uwx ]
v
q3 ,
such that v ⇒∗ x ′ w wx ,
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
15 / 22
Construction
Idea of the construction
If q0
uw
q1
x
wx wx
q2
q3 ,
i.e. pattern wx
then : q0 , [ǫ]
uw
uw
Furthermore, if q0
x
q1 , [uw ]
q1
x
q3 , [uwx ]
v
q2
q3 ,
such that v ⇒∗ x ′ w wx ,
then : q0 , [ǫ]
uw
Paul Brunet and Damien Pous (ENS de Lyon)
q1 , [uw ]
x
Decidability in REL∨
q3 , [uwx ]
17 juin 2013
15 / 22
Construction
Construction : Γ
We write X̄ ≔ X ∪ X ′ .
For w ∈ X̄ ∗ , consider the language defined inductively :
Γ:
X̄ ∗
ǫ
wx
−→ P(X̄ ∗ )
7−→ ǫ
∗
7−→ (x ′ Γ(w )x )
Properties of Γ(w )
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
16 / 22
Construction
Construction : Γ
We write X̄ ≔ X ∪ X ′ .
For w ∈ X̄ ∗ , consider the language defined inductively :
Γ:
X̄ ∗
ǫ
wx
−→ P(X̄ ∗ )
7−→ ǫ
∗
7−→ (x ′ Γ(w )x )
Properties of Γ(w )
1
Γ(w ) is upward
-closed : u
Paul Brunet and Damien Pous (ENS de Lyon)
v ∈ Γ(w ) ⇒ u ∈ Γ(w ) ;
Decidability in REL∨
17 juin 2013
16 / 22
Construction
Construction : Γ
We write X̄ ≔ X ∪ X ′ .
For w ∈ X̄ ∗ , consider the language defined inductively :
Γ:
X̄ ∗
ǫ
wx
−→ P(X̄ ∗ )
7−→ ǫ
∗
7−→ (x ′ Γ(w )x )
Properties of Γ(w )
1
2
Γ(w ) is upward
u ∈ Γ(w ) ⇒ wu
-closed : u
∗
w;
Paul Brunet and Damien Pous (ENS de Lyon)
v ∈ Γ(w ) ⇒ u ∈ Γ(w ) ;
Decidability in REL∨
17 juin 2013
16 / 22
Construction
Construction : Γ
We write X̄ ≔ X ∪ X ′ .
For w ∈ X̄ ∗ , consider the language defined inductively :
Γ:
X̄ ∗
ǫ
wx
−→ P(X̄ ∗ )
7−→ ǫ
∗
7−→ (x ′ Γ(w )x )
Properties of Γ(w )
1
2
3
Γ(w ) is upward
u ∈ Γ(w ) ⇒ wu
-closed : u
∗
w;
∃v suffix of w : u
Paul Brunet and Damien Pous (ENS de Lyon)
∗
v ∈ Γ(w ) ⇒ u ∈ Γ(w ) ;
v v ⇒ u ∈ Γ(w ) ;
Decidability in REL∨
17 juin 2013
16 / 22
Construction
Construction : Γ
We write X̄ ≔ X ∪ X ′ .
For w ∈ X̄ ∗ , consider the language defined inductively :
Γ:
X̄ ∗
ǫ
wx
−→ P(X̄ ∗ )
7−→ ǫ
∗
7−→ (x ′ Γ(w )x )
Properties of Γ(w )
1
2
3
4
Γ(w ) is upward
u ∈ Γ(w ) ⇒ wu
-closed : u
∗
w;
v ∈ Γ(w ) ⇒ u ∈ Γ(w ) ;
∃v suffix of w : u ∗ v v ⇒ u ∈ Γ(w ) ;
subsequently : Γ(w ) = cl ↑ ({v v | v suffix of w })
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
16 / 22
Construction
Γ(w ) is upward-closed
Γ(xn · · · x1 ) is recognized by :
0
Paul Brunet and Damien Pous (ENS de Lyon)
x1′
x1
1
x2′
x2
2
Decidability in REL∨
x3′
x3
xn′
xn
n
17 juin 2013
17 / 22
Construction
Γ(w ) is upward-closed
Γ(xn · · · x1 ) is recognized by :
0
x1′
x1
x2′
1
x2
2
x3′
x3
xn′
xn
n
Property
x
x′
In this automaton, if q1 −
→ q2 , then q2 −→ q1 .
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
17 / 22
Construction
Γ(w ) is upward-closed
Γ(xn · · · x1 ) is recognized by :
0
x1′
x2′
1
x1
x2
2
x3′
x3
xn′
xn
n
Property
x′
x
In this automaton, if q1 −
→ q2 , then q2 −→ q1 .
Corollary
u1
If 0
0
u1
w
q1
q1
w
u2
q2
q2
w
Paul Brunet and Damien Pous (ENS de Lyon)
0 , then
q1
w
q2
u2
0.
Decidability in REL∨
17 juin 2013
17 / 22
Construction
Construction : γ
Notations
We consider an automaton A = hQ, X̄ , I, F , ∆i,
and define ∀x ∈ X̄ , Rx ≔ {(q, q ′ ) | (q, x , q ′ ) ∈ ∆}.
Definition : γ
γ:
Paul Brunet and Damien Pous (ENS de Lyon)
X̄ ∗
ǫ
w ·x
−→
RelQ
7−→
IdQ
∗
7−→ (Rx ′ ◦ γ(w ) ◦ Rx )
Decidability in REL∨
17 juin 2013
18 / 22
Construction
Construction : γ
Notations
We consider an automaton A = hQ, X̄ , I, F , ∆i,
and define ∀x ∈ X̄ , Rx ≔ {(q, q ′ ) | (q, x , q ′ ) ∈ ∆}.
Definition : γ
γ:
X̄ ∗
ǫ
w ·x
−→
RelQ
7−→
IdQ
∗
7−→ (Rx ′ ◦ γ(w ) ◦ Rx )
And G = X̄ ∗ /γ = {[w ] | w ∈ X̄ ∗ } = {{u | γ(u) = γ(w )} | w ∈ X̄ ∗ } (finite)
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
18 / 22
Construction
Construction : γ
Notations
We consider an automaton A = hQ, X̄ , I, F , ∆i,
and define ∀x ∈ X̄ , Rx ≔ {(q, q ′ ) | (q, x , q ′ ) ∈ ∆}.
Definition : γ
γ:
X̄ ∗
ǫ
w ·x
−→
RelQ
7−→
IdQ
∗
7−→ (Rx ′ ◦ γ(w ) ◦ Rx )
And G = X̄ ∗ /γ = {[w ] | w ∈ X̄ ∗ } = {{u | γ(u) = γ(w )} | w ∈ X̄ ∗ } (finite)
Property
γ(w ) = σ̂(Γ(w )) where σ(x ) = Rx , which means
u
(q1 , q2 ) ∈ γ(w ) ⇔ (∃u ∈ Γ(w ) : q1 −
→ q2 )
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
18 / 22
Construction
Closure Automaton
cl(A )
cl(A ) ≔ hQ × G, X̄ , I × {1}, F × G, ∆′ i
where ∆′ ≔ {((q1 , [w ]), x , (q2 , [wx ])) | (q1 , q2 ) ∈ Rx ◦ γ(wx )} Which is to say
x
(q1 , [w ]) −
→ (q2 , [wx ]) if :
x
q1 −
→ q3 and (q3 , q2 ) ∈ γ(wx )
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
19 / 22
Construction
Closure Automaton
cl(A )
cl(A ) ≔ hQ × G, X̄ , I × {1}, F × G, ∆′ i
where ∆′ ≔ {((q1 , [w ]), x , (q2 , [wx ])) | (q1 , q2 ) ∈ Rx ◦ γ(wx )} Which is to say
x
(q1 , [w ]) −
→ (q2 , [wx ]) if :
x
q1 −
→ q3 and (q3 , q2 ) ∈ γ(wx )
The γ function needs to (or at least should) be pre-computed, but the rest of
the contruction can be done on-the-fly.
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
19 / 22
Construction
Closure Automaton
cl(A )
cl(A ) ≔ hQ × G, X̄ , I × {1}, F × G, ∆′ i
where ∆′ ≔ {((q1 , [w ]), x , (q2 , [wx ])) | (q1 , q2 ) ∈ Rx ◦ γ(wx )} Which is to say
x
(q1 , [w ]) −
→ (q2 , [wx ]) if :
x
q1 −
→ q3 and (q3 , q2 ) ∈ γ(wx )
The γ function needs to (or at least should) be pre-computed, but the rest of
the contruction can be done on-the-fly.
One can build a deterministic closure automaton with set of states
P(Q) × G and transition function :
δ({q1 . . . qn }, [w ]) ≔ ({p | ∃qi : (qi , p) ∈ Rx ◦ γ(wx )}, [wx ]).
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
19 / 22
Construction
To conclude
is confluent. Furthermore,
u
v1
v2
64
64
v
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
20 / 22
Construction
To conclude
is confluent. Furthermore,
u
v1
v2
64
64
v
REL∨
CReg
CKA ⊢
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
20 / 22
Construction
To conclude
is confluent. Furthermore,
u
v1
v2
64
64
v
REL∨
CReg
CKA ⊢
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
20 / 22
Construction
To conclude
is confluent. Furthermore,
u
v1
v2
64
64
v
REL∨
CReg
CKA ⊢
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
20 / 22
Construction
To conclude
is confluent. Furthermore,
u
v1
v2
64
64
v
REL∨
CReg
CKA ⊢
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
20 / 22
Construction
To conclude
is confluent. Furthermore,
u
v1
v2
64
64
v
REL∨
CReg
CKA ⊢
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
20 / 22
Examples
Table of Contents
1
Kleene Algebrae with converse
2
Construction of the closure of an automaton
3
On examples
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
21 / 22
Examples
Bibliography
S.L. Bloom, Z. Ésik, and Gh. Stefanescu.
Notes on equational theories of relations.
algebra universalis, 33(1) :98–126, 1995.
Z. Ésik and L. Bernátsky.
Equational properties of kleene algebras of relations with conversion.
Theor. Comput. Sci., 137(2) :237–251, January 1995.
Dexter Kozen.
A completeness theorem for kleene algebras and the algebra of regular events.
Information and Computation, 110 :366–390, 1994.
Paul Brunet and Damien Pous (ENS de Lyon)
Decidability in REL∨
17 juin 2013
22 / 22

Documents pareils