Re: Doubt

From: "NUPUL" <nupul.kukreja@xxxxxxxxx>
Date: 20 Feb 2007 23:26:30 -0800

On Feb 20, 12:16 pm, rajababu...@xxxxxxxxx wrote:

if A1 and A2 are Finite automata's then L(A1)-L(A2)=?
where L is language

Regular languages are close under the operations of union/intersection/
difference etc.

thus: L(A1)-L(A2) = Regular = those strings that are in A1 but NOT in
A2.

Nupul

.

References:
- Doubt
  - From: rajababu . m1

Prev by Date: Worst-case Performance of Insertion Sort
Next by Date: Re: Worst-case Performance of Insertion Sort
Previous by thread: Doubt
Next by thread: Doubt
Index(es):
- Date
- Thread