Subject
General Computer Science,Theoretical Computer Science
Reference46 articles.
1. On the decidability of iterated semidirect products with applications to complexity;Almeida;Proc. London Math. Soc.,2000
2. J. Almeida, et P. Weil. Free profinite semigroups over semidirect products, Izvestiya VUZ Matematika 39 (1995) 3–31 (English version, Russian Mathem. (Iz. VUZ.) 39 (1995) 1–28).
3. M. Arfi, Polynomial operations and rational languages, 4th STACS, Lecture Notes in Computer Science, vol. 247, Springer, Berlin, 1987, pp. 198–206.
4. Opérations polynomiales et hiérarchies de concaténation;Arfi;Theoret. Comput. Sci.,1991
5. B. Borchert, D. Kuske, F. Stephan, On existentially first-order definable languages and their relation to NP, Proc. ICALP 1998, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, New York, 1998.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献