Funder
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. Almeida, J., Rodaro, E.: Semisimple synchronizing automata and the Wedderburn-Artin theory. Int. J. Found. Comput. Sc. 27(02), 127–145 (2016). https://doi.org/10.1142/S0129054116400037
2. Araújo, J., Cameron, P.J., Steinberg, B.: Between primitive and 2-transitive: synchronization and its friends. arXiv: 1511.03184 (2015)
3. Bell, J., Brzozowski, J., Moreira, N., Reis, R.: Symmetric groups and quotient complexity of boolean operations. In: Esparza, J., et al. (eds.) ICALP 2014, LNCS, vol. 8573, pp 1–12. Springer (2014). https://doi.org/10.1007/978-3-662-43951-7_1
4. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. J. Symbolic Comput. 24(3–4), 235–265 (1997). https://doi.org/10.1006/jsco.1996.0125
5. Brzozowski, J.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15(1/2), 71–89 (2010). https://doi.org/10.4204/EPTCS.3.2
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献