Sulla complessita di alcuni problemi di conteggio

DOI10.1007/BF02576653zbMath0456.68048WikidataQ57518729 ScholiaQ57518729MaRDI QIDQ1151037

Mauro Torelli, Alberto Bertoni, Giancarlo Mauri

Publication date: 1980

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

combinatorial problemsdesign of algorithmsalgebraic approachcounting strings of given length generated by a regular grammarcounting trees recognized by a tree automaton

Mathematics Subject Classification ID

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

Related Items (1)

An analysis of Monte Carlo algorithms for counting problems

Cites Work

• Automatic solution of a certain class of combinatorial problems
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• A homomorphism theorem for weighted context-free grammars
• The Complexity of Enumeration and Reliability Problems
• A representation theorem for algebraic and context-free power series in noncommuting variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sulla complessita di alcuni problemi di conteggio