Publisher
Springer International Publishing
Reference30 articles.
1. Berlinkov, M.V.: Approximating the minimum length of synchronizing words is hard. Theory Comput. Syst. 54(2), 211–223 (2014)
2. Bläsius, T., Friedrich, T., Lischeid, J., Meeks, K., Schirneck, M.: Efficiently enumerating hitting sets of hypergraphs arising in data profiling. In: Algorithm Engineering and Experiments (ALENEX), pp. 130–143. SIAM (2019)
3. Bodlaender, H., Downey, R.G., Fellows, M.R., Wareham, H.T.: The parameterized complexity of sequence alignment and consensus. Theor. Comput. Sci. 147, 31–54 (1995)
4. Bruchertseifer, J., Fernau, H.: Synchronizing series-parallel automata with loops. In: Freund, R., Holzer, M., Sempere, J.M. (eds.) Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA, pp. 63–78. Österreichische Computer Gesellschaft (2019)
5. Cai, L., Chen, J., Downey, R., Fellows, M.: On the parameterized complexity of short computation and factorization. Arch. Math. Logic 36, 321–337 (1997)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献