References
- Mac Lane S. Categorical algebra. Bull Amer Math Soc. 1965;71:40–106.
- Mac Lane S. Natural associativity and commutativity. Rice Univ Studies. 1963;49:28–46.
- Boardman JM, Vogt RM. Homotopy-everything H-spaces. Bull Amer Math Soc. 1968;74:1117–1122.
- Boardman JM, Vogt RM. Homotopy invariant algebraic structures on topological spaces. Berlin: Springer-Verlag; 1973. Lecture Notes in Mathematics 347
- Bultel JP, Giraudo S. Combinatorial Hopf algebras from pros. J Algebr Comb. 2016;44(2):455–493.
- Giraudo S. Colored operads, series on colored operads, and combinatorial generating systems. Preprint arXiv:1605.04697v1.
- Eckmann B, Hilton PJ. Group-like structures in general categories. I. Multiplications and comultiplications. Math Ann. 1962;145(3):227–255.
- Chomsky N. Three models for the description of language. IEEE Trans Inf Theory. 1956;2:113–124.
- Chomsky N, Schützenberger MP. The algebraic theory of context free languages. In: Braffort P, Hirschberg D, editors. Computer programming and formal languages. Amsterdam: North Holland; 1963. p. 118–161.
- Kleene SC. Representation of events in nerve nets and finite automata. In: Shannon CE, McCarthy J, editors. Automata studies. Princeton: Princeton University Press; 1956. p. 3–41.
- McCulloch WS, Pitt E. A logical calculus of the ideas immanent in nervous activity. Bull Math Sci. 1943;5:541–544.
- Rabin MO, Scott D. Finite automata and their decision problems, IBM jour. Res Dev. 1959;3(2):114–125.
- Schützenberger MP. On the definition of a family of automata. Inf Control. 1961;4:245–270.
- Fülöp Z, Vogler H. Weighted tree automata and tree transducers. In: Handbook of weighted automata. Droste-Kuich-Vogler, editor. Berlin: Springer; 2009. p. 313–404.
- Drewes F. Lecture notes on tree automata. In: Chapter I bottom-up and top-down tree automata by Adam Sernheim. Frank Drewes, editor. Umea: Umea University. p. 1–7.
- Lodaya K, Weil P. A Kleene iteration for parallelism. International Conference on Foundations of Software Technology and Theoretical Computer Science; 1998. p. 355–366.
- Lodaya K, Weil P. Series-parallel languages and the bounded-width property. Theoret Comput Sci. 2000;237(1–2):347–380.
- Bedon N. Logic and branching automata. Proceedings of MFCS 2013: 38nd International Symposium on Mathematical Foundations of Computer Science, Klosterneuburg, Austria. Krishnendu Chatterjee and Jiri Sgall Eds. vol. 8087 of Lecture Notes in Computer Science; 2013. p. 123–134.
- Heindel T. A Myhill-Nerode theorem beyond trees and forests via finite syntactic categories internal to monoids; 2017. Available from: http://www.informatik.uni-leipzig.de/∼heindel/MyhillNerodeFoSSaCS18.pdf
- Bossut F. Rationalité et reconnaissabilité dans les graphes [PhD thesis]. Université Lille: Sciences et Technologies; 1986.
- Bossut F, Dauchet M, Warin B. A Kleene theorem for a class of planar acyclic graphs. Inform Comput. 1995;117(2):251–265.
- Temperley N, Lieb E. Relations between the ‘Percolation’ and ‘Colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘Percolation’ problem. Proc R Soc Ser. 1971;A322:251–280.
- Ekert A. Introduction to quantum computation. In: Fundamentals of quantum informations. Dieter Heiss, editor. Berlin: Springer-Verlag; 2002.