Author:
Okhotin Alexander,Salomaa Kai
Funder
Russian Science Foundation
Subject
General Computer Science,Theoretical Computer Science
Reference28 articles.
1. R. Alur, P. Madhusudan, Visibly pushdown languages, in: ACM Symposium on Theory of Computing, STOC 2004, Chicago, USA, 13–16 June 2004, pp. 202–211.
2. Adding nesting structure to words;Alur;J. ACM,2009
3. Intersection and union of regular languages and state complexity;Birget;Inf. Process. Lett.,1992
4. Input driven languages are recognized in logn space;von Braunmühl;Ann. Discrete Math.,1985
5. State complexity of proportional removals;Domaratzki;J. Autom. Lang. Comb.,2002