Counting problems for parikh images
From MaRDI portal
Publication:5111226
DOI10.4230/LIPIcs.MFCS.2017.12zbMath1441.68124OpenAlexW2774819238MaRDI QIDQ5111226
Christoph Haase, Stefan Kiefer, Markus Lohrey
Publication date: 26 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8059/pdf/LIPIcs-MFCS-2017-12.pdf/
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the number of strings of given length in context-free languages
- On the equivalence, containment, and covering problems for the regular and context-free languages
- The power of the middle bit of a \(\#\)P function
- Polynomial Space Counting Problems
- PP is as Hard as the Polynomial-Time Hierarchy
- The Odds of Staying on Budget
- Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata
- Complexity of Problems of Commutative Grammars
- First-order and counting theories ofω-automatic structures
This page was built for publication: Counting problems for parikh images
