Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.
2. Birkhof, G. Lattice Theory. Amer. Math. Soc., Providence, RI, 1940.
3. Cartier, P., and Foata, D. Problèmes combinatoires de commutation et réarrangements. Lect. Notes in Math. 85. Springer, 1969.
4. Cori, R., and Métivier, Y. Recognizable subsets of some partially abelian monoids. Theoretical Computer Science, 35:179–189, 1985.
5. Cori, R., Métivier, Y., and Zielonka, W. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106:159–202, 1993.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Solution sets for equations over free groups are EDT0L languages;International Journal of Algebra and Computation;2016-08
2. Forbidden traces and forbidden subtraces;Cybernetics and Systems Analysis;2013-05
3. Inclusion problems in trace monoids;Cybernetics and Systems Analysis;2010-07