Author:
Lavado Giovanna J.,Pighizzini Giovanni,Seki Shinnosuke
Publisher
Springer International Publishing
Reference18 articles.
1. Aceto, L., Ésik, Z., Ingólfsdóttir, A.: A fully equational proof of Parikh’s theorem. RAIRO-Theor. Inf. Appl. 36(2), 129–153 (2002)
2. Câmpeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. Journal of Automata, Languages and Combinatorics 7(3), 303–310 (2002)
3. Domaratzki, M., Pighizzini, G., Shallit, J.: Simulating finite automata with context-free grammars. Inform. Process. Lett. 84(6), 339–344 (2002)
4. Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fund. Inform. 31(1), 13–25 (1997)
5. Ginsburg, S., Spanier, E.H.: Bounded ALGOL-like languages. T. Am. Math. Soc. 113, 333–368 (1964)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献