Recommendations
- On the Parikh membership problem for FAs, PDAs, and CMs
- Parikh's theorem and descriptional complexity
- Tightening the complexity of equivalence problems for commutative grammars
- Operational State Complexity under Parikh Equivalence
- Converting nondeterministic automata and context-free grammars into Parikh equivalent deterministic automata
Cites work
- Complexity of problems of commutative grammars
- Efficient construction of semilinear representations of languages accepted by unary nondeterministic finite automata
- First-order and counting theories ofω-automatic structures
- scientific article; zbMATH DE number 6677405 (Why is no real title available?)
- scientific article; zbMATH DE number 8788 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 7297838 (Why is no real title available?)
- scientific article; zbMATH DE number 6472651 (Why is no real title available?)
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Polynomial Space Counting Problems
- PP is as Hard as the Polynomial-Time Hierarchy
- The complexity of computing the number of strings of given length in context-free languages
- The odds of staying on budget
- The power of the middle bit of a \(\#\)P function
Cited in
(5)
This page was built for publication: Counting problems for Parikh images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111226)
