Algebraic languages and polyominoes enumeration

This publication has 30 references indexed in Scilit:

• Binomial determinants, paths, and hook length formulae
  Advances in Mathematics, 1985
• Book Review: Automata-theoretic aspects of formal power series
  Bulletin of the American Mathematical Society, 1979
• k + 1 Heads Are Better than k
  Journal of the ACM, 1978
• M. P. Schützenberger. On the definition of a family of automata. Information and control, vol. 4 (1961), pp. 245–270. - M. P. Schützenberger. Finite counting automata.Information and control, vol. 5 (1962), pp. 91–107. - M. P. Schützenberger. Certain elementary families of automata. Proceedings of the Symposium of Mathematical Theory of Automata, New York, N.Y., Microwave Research Symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, New York1963, pp. 139–153.
  The Journal of Symbolic Logic, 1969
• A helpful result for proving inherent ambiguity
  Theory of Computing Systems, 1968
• STACKS
  The Quarterly Journal of Mathematics, 1968
• N. Chomsky and M. P. Schützenberger. The algebraic theory of context-free languages. Computer programming and formal systems, edited by P. Braffort and D. Hirschberg, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1963, pp. 118–161.
  The Journal of Symbolic Logic, 1967
• The mathematical theory of context-free languages: S. Ginsburg. McGraw-Hill, New York, 1966. pp. ix + 232
  Information Storage and Retrieval, 1967
• Cell Growth Problems
  Canadian Journal of Mathematics, 1967
• Contributions to the Cell Growth Problem
  Canadian Journal of Mathematics, 1962