Author:
Caucal Didier,Hieu Dinh Trong
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Caucal, D.: On the regular structure of prefix rewriting. Theoretical Computer Science 106, 61–86 (1992)
2. Caucal, D., Czyzowicz, J., Fraczak, W., Rytter, W.: Efficient computation of throughput values of context-free languages. In: 12
th
CIAA, LNCS (to appear, 2007)
3. Courcelle, B.: Infinite graphs of bounded width. Mathematical Systems Theory 21(4), 187–221 (1989)
4. Lecture Notes in Computer Science;J. Esparza,2007
5. Hopkins, M., Kozen, D.: Parikh’s theorem in commutative Kleene algebra. In: Longo, G. (ed.) 14th LICS, pp. 394–401. IEEE, Los Alamitos (1999)