Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. J. Adámek, S. Milius, R.S.R. Myers, H. Urbat, Generalized Eilenberg theorem I: local varieties of languages, in: A. Muscholl (Ed.), FOSSACS 2014 (ETAPS), in: LNCS, vol. 8412, pp. 366–380.
2. Varieties of languages in a category;Adámek,2015
3. 1-way quantum finite automata: strengths, weaknesses and generalizations;Ambainis,1998
4. Recognisable languages over monads;Bojańczyk,2015
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Eilenberg's variety theorem without Boolean operations;Information and Computation;2022-05
2. Reiterman’s Theorem on Finite Algebras for a Monad;ACM Transactions on Computational Logic;2021-10-31
3. Minimal state automata for detecting a β globin gene mutation;International Journal of Applied Mathematics and Computer Science;2021
4. On Language Varieties Without Boolean Operations;Language and Automata Theory and Applications;2021