Unary self-verifying symmetric difference automata have a known tight bound of [Formula: see text] for their state complexity. We now consider the non-unary case and show that, every text], there is regular language accepted by nondeterministic automaton with states, such that its equivalent minimal deterministic finite has states. Furthermore, given any SV-XNFA it possible, up to isomorphism, ...

We deal with the following question: What is the proper way to introduce symmetric difference in orthomodular lattices? Imposing two natural conditions on this operation, six possibilities remain: the two (commutative) normal forms of the symmetric difference in Boolean algebras and four noncommutative terms. It turns out that in many respects the non-commutative forms, though more complex with...

The Navier-Stokes equations describe a large class of fluid flows but are difficult to solve analytically because of their nonlinearity. We present in this paper a parallel solver for the 3-D Navier-Stokes equations of incompressible unsteady flows with constant coefficients, discretized by the finite difference method. We apply the prediction-projection method which transforms the Navier-Stoke...

Using the Smith normal forms of the symmetric designs associated with the HKM and Lin difference sets, we show that not only are these two families of difference sets inequivalent, but also that the associated symmetric designs are nonisomorphic.