Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Lecture Notes in Computer Science;P.A. Abdulla,2008
2. Abdulla, P.A., Krcal, P., Yi, W.: Universality of R-automata with value copying. In: INFINITY 2008 Proceedings (2008)
3. Lecture Notes in Computer Science;S. Bala,2004
4. Bala, S.: Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms. Theory Of Computing Systems, Special Issue of Selected Best Papers from STACS 2004 39(1), 137–163 (2006)
5. Berstel, J.: Transductions and Context-Free Languages. B.G.Teubner, Stuttgart (1979)