An algorithm for the decomposition of finite languages

@article{Wieczorek2010AnAF,
  title={An algorithm for the decomposition of finite languages},
  author={W. Wieczorek},
  journal={Logic Journal of the IGPL},
  year={2010},
  volume={18},
  pages={355-366}
}
In this paper, an algorithm for the decomposition of a finite language is presented. The goal is to represent a finite language as a product (catenation) of two languages. This problem is thought to be intractable, although its NP-hardness has not been proven. The algorithm is based on checking through some subsets of the states of a minimal acyclic DFA. We also investigate two additional algorithms: the first is based on the use of integer linear programming, and the second is based on finding… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Algebraic Theory of Automata and Languages

  • M. Ito
  • World Scientific Publishing Company
  • 2004
1 Excerpt

A new algorithm for the construction of minimal acyclic DFAs

  • B. W. Watson
  • Science of Computer Programming 48
  • 2003
2 Excerpts

Similar Papers

Loading similar papers…