Counting problems and algebraic formal power series in noncommuting variables
From MaRDI portal
DOI10.1016/0020-0190(90)90089-GzbMATH Open0695.68053OpenAlexW2074415539MaRDI QIDQ910245FDOQ910245
Authors: Alberto Bertoni, Massimiliano Goldwurm, P. Massazza 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90089-g
Recommendations
Cites Work
- Planar Maps are Well Labeled Trees
- Algebraic languages and polyominoes enumeration
- A taxonomy of problems with fast parallel algorithms
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of computing the number of strings of given length in context-free languages
- Log Depth Circuits for Division and Related Problems
- Analytic models and ambiguity of context-free languages
- Logarithmic Depth Circuits for Algebraic Functions
- Formal languages and enumeration
- Title not available (Why is that?)
Cited In (10)
- Computing a context-free grammar-generating series
- Holonomic functions and their relation to linearly constrained languages
- Division in logspace-uniform NC
- On meta-normal forms for algebraic power series in noncommuting variables
- Title not available (Why is that?)
- Bounded length UCFG equivalence
- Ranking and formal power series
- Title not available (Why is that?)
- Preface
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
This page was built for publication: Counting problems and algebraic formal power series in noncommuting variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910245)
