Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. The Theory of Parsing, Translation and Compiling;Aho,1972
2. An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata;Beeri;Theoret. Comput. Sci.,1976
3. M. Benois and J. Sakarovitch, On the complexity of some extended word problems defined by cancellation rules, Inform. Process. Lett., to appear.
4. Congruences plus que parfaites et langages algébriques;Berstel;Séminaire d'informatique théorique de Paris 6,1976
5. Transductions and Context-free Languages;Berstel,1979
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献