Author:
Brzozowski Janusz A.,Davies Sylvie,Madan Abhishek
Publisher
Springer International Publishing
Reference9 articles.
1. Brzozowski, J.A., Davies, S., Madan, A.: State complexity of pattern matching in regular languages. Theoret. Comput. Sci. (2018).
https://doi.org/10.1016/j.tcs.2018.12.014
2. Brzozowski, J.A., Davies, S., Madan, A.: State complexity of pattern matching in regular languages. CoRR abs/1806.04645 (2018).
http://arxiv.org/abs/1806.04645
3. Brzozowski, J.A., Jirásková, G., Li, B.: Quotient complexity of ideal languages. Theoret. Comput. Sci. 470, 36–52 (2013).
https://doi.org/10.1016/j.tcs.2012.10.055
4. Crochemore, M., Hancart, C.: Automata for matching patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 399–462. Springer, Heidelberg (1997).
https://doi.org/10.1007/978-3-662-07675-0_9
5. Elloumi, M., Iliopoulos, C., Wang, J.T., Zomaya, A.Y.: Pattern Recognition in Computational Molecular Biology: Techniques and Approaches. Wiley, Hoboken (2015)