Factorization Forests

@inproceedings{Bojanczyk2009FactorizationF,
  title={Factorization Forests},
  author={Mikolaj Bojanczyk},
  booktitle={Developments in Language Theory},
  year={2009}
}
A survey of applications of factorization forests. Fix a regular language L ⊆ A∗. You are given a word a1 · · · an ∈ A∗. You are allowed to build a data structure in time O(n). Then, you should be able to quickly answer queries of the form: given i ≤ j ∈ {1, . . . , n}, does the infix ai · · · aj belong to L? What should the data structure be? What does quickly mean? There is natural solution that uses a divide and conquer approach. Suppose that the language L is recognized by a… CONTINUE READING

References

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

Omega-regular expressions with bounds

  • M. Bojańczyk, T. Colcombet
  • In Logic in Computer Science, pages 285–296,
  • 2006
2 Excerpts

Similar Papers

Loading similar papers…