Sulla complessita di alcuni problemi di conteggio
type: Item
instance of: scholarly article
title: Sulla complessita di alcuni problemi di conteggio
zbMATH Open document ID: 0456.68048
DOI: 10.1007/BF02576653
published in: Calcolo
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3714928
zbMATH Keywords: algebraic approach
zbMATH Keywords: combinatorial problems
zbMATH Keywords: counting strings of given length generated by a regular grammar
zbMATH Keywords: counting trees recognized by a tree automaton
zbMATH Keywords: design of algorithms
Wikidata QID: Q57518729
author: Alberto Bertoni
author: Giancarlo Mauri
author: Mauro Torelli
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q4769997
cites work: Q4140390
cites work: Q4175565
cites work: Automatic solution of a certain class of combinatorial problems
cites work: Q3250680
cites work: Q3243274
cites work: A representation theorem for algebraic and context-free power series in noncommuting variables
cites work: A homomorphism theorem for weighted context-free grammars
cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
cites work: The Complexity of Enumeration and Reliability Problems
description: scientific article; zbMATH DE number 3714928