Efficient membership testing for regular languages

Regular language membership is a key primitive in myriads of applications, from web scraping to bioinformatics. The quick growth of data volume and the presence of noise in the applications demand efficient and robust methods for membership testing, and this talk will provide a survey of such methods and open questions.

Authors

• Tatiana Starikovskaya

Keywords

No keywords are indexed for this paper.