Union & Concat: Question on Implementation

[Beau Osborne]

In the first example in examples.txt, it appears that the 'new start state'
is appended as the final element.
---- i.e.. (0,1,2,3,4) where 4 is the new start state.

Can we implement nfdaUnion and nfdaConcat so that our new start state is the
first element?
---- i.e.. (0,1,2,3,4) where 0 is the new start state.

Just so you know, I have already created working algorithms using the '0'
start state implementation.

Thanks,

Osborne

[Benjamin Ho]

that's how ours is as well. it should be ok since they are equivalent.
i hope so.

Post by Beau Osborne
In the first example in examples.txt, it appears that the 'new start
state' is appended as the final element.
---- i.e.. (0,1,2,3,4) where 4 is the new start state.
Can we implement nfdaUnion and nfdaConcat so that our new start state is
the first element?
---- i.e.. (0,1,2,3,4) where 0 is the new start state.
Just so you know, I have already created working algorithms using the '0'
start state implementation.
Thanks,
Osborne

[Nedialko B. Dimitrov]

Yes, I will accept this.

Ned.

Post by Benjamin Ho
that's how ours is as well. it should be ok since they are equivalent.
i hope so.

Post by Beau Osborne
In the first example in examples.txt, it appears that the 'new start
state' is appended as the final element.
---- i.e.. (0,1,2,3,4) where 4 is the new start state.
Can we implement nfdaUnion and nfdaConcat so that our new start state is
the first element?
---- i.e.. (0,1,2,3,4) where 0 is the new start state.
Just so you know, I have already created working algorithms using the '0'
start state implementation.
Thanks,
Osborne