Counting problems for Parikh images
Given finite-state automata (or context-free grammars) A, B over the same alphabet and a Parikh vector ~p, we study the complexity of deciding whether the number of words in the language of A with Parikh image ~p is greater than the number of such words in the language of B. Recently, this problem t...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
Schloss Dagstuhl
2017
|