- L(L|C|_)*
- (ab(c|cd|
))|(bc(d|))
ou (ab|abc|abcd|bc|bcd) en recensant toutes les occurrences (langage fini) - (a|b)*abb(a|b)*
))|(bc(d|))
begin
q := q0 ;
i := 1 ;
ok := true ;
while i <> n+1 and ok do begin
if existe_t(q,x[i]) then q := delta(q,x[i])
else ok := FALSE
i := i + 1 ;
end ;
if i = n+1 and terminal(q) then write('Mot reconnu')
else write('Mot non reconnu') ;
end
| a | b | c | z | |
|---|---|---|---|---|
| ->{1} | {2,3} | {4} | ||
| {2,3} | {4} | {3} | {1,2} | {4} |
| <-{4} | {1} | |||
| {3} | {4} | {3} | ||
| {1,2} | {2,3} | {1,2} | {4} |
-transitions.)