A Parallel Algorithm for Computing all Homomorphisms of Deterministic Finite Automata

Boleslaw Mikolajczak. A Parallel Algorithm for Computing all Homomorphisms of Deterministic Finite Automata. In Panos M. Pardalos, Mauricio G. C. Resende, K. G. Ramakrishnan, editors, Workshop on Parallel Processing of Discrete Optimization Problems, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 28-29, 1994. Volume 22 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 233-258, DIMACS/AMS, 1994.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.