Author:
Masopust Tomáš,Thomazo Michaël
Publisher
Springer International Publishing
Reference15 articles.
1. Blanchet-Sadri, F.: Games, equations and the dot-depth hierarchy. Comput. Math. Appl. 18(9), 809–822 (1989)
2. Blanchet-Sadri, F.: Equations and monoid varieties of dot-depth one and two. Theoret. Comput. Sci. 123(2), 239–258 (1994)
3. Cho, S., Huynh, D.T.: Finite-automaton aperiodicity is PSPACE-complete. Theor. Comput. Sci. 88(1), 99–116 (1991)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)
5. Hofman, P., Martens, W.: Separability by short subsequences and subwords. In: ICDT. LIPIcs, vol. 31, pp. 230–246 (2015)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献