1. Aho, A.V.: Algorithms for finding patterns in strings, pp. 275–300. MIT Press, Cambridge (1990)
2. Câmpeanu, C., Santean, N.: On the intersection of regex languages with regular languages. Theoretical Computer Science 410, 2336–2344 (2009)
3. Freydenberger, D.D.: Extended Regular Expressions: Succinctness and Decidability. In: 28th International Symposium on Theoretical Aspects of Computer Science, Dagstuhl, Germany. Leibniz International Proceedings inInformatics (LIPIcs), vol. 9, pp. 507–518. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2011)
4. Ginsburg, S., Greibach, S.: Deterministic context free languages. Information and Control 9(6), 620–648 (1966)
5. Ginsburg, S., Rose, G.F.: Operations which preserve definability in languages. Journal of the ACM 10(2), 175–195 (1963)