Three efficient algorithms for counting problems☆

https://doi.org/10.1016/0020-0190(79)90093-0Get rights and content

First page preview

First page preview
Click to open first page preview
View PDF

References (9)

  • A.V. Aho et al.

    The Design and Analysis of Computer Algorithms

    (1974)
  • A. Bertoni et al.

    An algebraic approach to problem solution and problem semantics

  • N. Chomsky et al.

    The algebraic theory of context-free languages

  • J. Cohen et al.

    Automatic solution of a certain class of combinatorial problems

    Inf. Proc. Letters

    (1977)
There are more references available in the full text version of this article.

Cited by (0)

☆

This research has been developed in the frame of the Communication and Programming Project of Università di Milano and Honeywell Information Systems Italia.

View full text
Copyright © 1979 Published by Elsevier B.V.