Three efficient algorithms for counting problems

DOI10.1016/0020-0190(79)90093-0zbMath0404.68068OpenAlexW2049512207WikidataQ57518731 ScholiaQ57518731MaRDI QIDQ1256858

Alberto Bertoni, Giancarlo Mauri, Mauro Torelli

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90093-0

zbMATH Keywords

LanguageAutomataComputational ComplexityCombinatorial ProblemsCounting StringsCounting TreesEfficient Algorithms for Counting Problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Artificial intelligence (68T99) Discrete mathematics in relation to computer science (68R99)

Related Items

On efficient computation of the coefficients of some polynomials with applications to some enumeration problems, Preface

Cites Work

• Automatic solution of a certain class of combinatorial problems
• On the computational power of pushdown automata
• Initial Algebra Semantics and Continuous Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item