Counting problems and algebraic formal power series in noncommuting variables
type: Item
instance of: scholarly article
title: Counting problems and algebraic formal power series in noncommuting variables
zbMATH Open document ID: 0695.68053
DOI: 10.1016/0020-0190(90)90089-G
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4139307
zbMATH Keywords: formal languages
zbMATH Keywords: circuit complexity
zbMATH Keywords: integer division
zbMATH Keywords: counting problems
author: Alberto Bertoni
author: Massimiliano Goldwurm
author: P. Massazza
MaRDI profile type: Publication
cites work: Log Depth Circuits for Division and Related Problems
cites work: Q3773366
cites work: The complexity of computing the number of strings of given length in context-free languages
cites work: Q5526125
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Planar Maps are Well Labeled Trees
cites work: Algebraic languages and polyominoes enumeration
cites work: Analytic models and ambiguity of context-free languages
cites work: Formal languages and enumeration
cites work: Q3669422
cites work: Logarithmic Depth Circuits for Algebraic Functions
cites work: Q4155837
cites work: The Complexity of Enumeration and Reliability Problems
full work available at URL: 0020-0190(90)90089-g
OpenAlex ID: W2074415539
description: scientific article; zbMATH DE number 4139307